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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:39:00,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:39:00,905 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:39:00,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:39:00,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:39:00,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:39:00,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:39:00,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:39:00,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:39:00,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:39:00,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:39:00,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:39:00,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:39:00,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:39:00,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:39:00,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:39:00,939 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:39:00,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:39:00,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:39:00,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:39:00,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:39:00,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:39:00,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:39:00,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:39:00,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:39:00,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:39:00,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:39:00,972 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:39:00,973 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:39:00,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:39:00,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:39:00,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:39:00,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:39:00,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:39:00,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:39:00,979 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:39:00,980 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:39:00,992 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:39:00,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:39:00,993 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:39:00,993 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:39:00,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:39:00,993 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:39:00,993 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:39:00,994 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:39:00,994 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:39:00,994 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:39:00,994 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:39:00,994 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:39:00,994 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:39:00,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:39:00,995 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:39:00,995 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:39:00,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:39:00,996 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:39:00,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:39:00,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:39:00,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:39:00,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:39:00,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:39:00,997 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:39:00,997 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:39:00,997 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:39:00,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:39:00,998 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:39:00,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:39:00,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:39:00,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:39:00,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:39:00,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:39:00,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:39:00,999 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:39:00,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:39:00,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:39:00,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:39:01,000 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:39:01,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:39:01,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:39:01,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:39:01,067 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:39:01,068 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:39:01,069 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-03-04 16:39:01,069 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-03-04 16:39:01,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:39:01,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:39:01,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:39:01,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:39:01,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:39:01,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:39:01,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:39:01,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:39:01,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:39:01,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... [2019-03-04 16:39:01,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:39:01,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:39:01,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:39:01,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:39:01,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:39:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:39:01,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:39:01,610 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:39:01,610 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-03-04 16:39:01,612 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:39:01 BoogieIcfgContainer [2019-03-04 16:39:01,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:39:01,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:39:01,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:39:01,617 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:39:01,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:39:01" (1/2) ... [2019-03-04 16:39:01,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d5d23d and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:39:01, skipping insertion in model container [2019-03-04 16:39:01,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:39:01" (2/2) ... [2019-03-04 16:39:01,620 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-03-04 16:39:01,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:39:01,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-03-04 16:39:01,658 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-03-04 16:39:01,690 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:39:01,691 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:39:01,691 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:39:01,691 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:39:01,691 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:39:01,691 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:39:01,691 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:39:01,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:39:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-03-04 16:39:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:39:01,713 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:01,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:39:01,717 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-03-04 16:39:01,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:01,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:01,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:01,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:01,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:01,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:39:01,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:39:01,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:01,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:39:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:39:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:39:01,922 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-03-04 16:39:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:02,111 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-03-04 16:39:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:02,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:39:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:02,127 INFO L225 Difference]: With dead ends: 29 [2019-03-04 16:39:02,128 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:39:02,131 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-03-04 16:39:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:39:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-03-04 16:39:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:39:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-03-04 16:39:02,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-03-04 16:39:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:02,171 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-03-04 16:39:02,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:39:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-03-04 16:39:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:39:02,173 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:02,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:39:02,173 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-03-04 16:39:02,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:02,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:02,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:02,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:02,425 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:39:02,430 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-03-04 16:39:02,508 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:02,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:02,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:02,584 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:02,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:02,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:02,592 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-03-04 16:39:02,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:02,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:02,632 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:02,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:02,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:02,853 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:02,875 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:02,979 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,138 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,188 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,244 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:03,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:03,294 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:03,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:03,345 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:03,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:03,531 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,583 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,603 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,654 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,699 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,726 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,960 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:03,961 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:04,176 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-03-04 16:39:04,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:04,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,265 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:04,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:04,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:04,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:04,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:04,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:04,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:04,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:04,391 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-03-04 16:39:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:04,765 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-03-04 16:39:04,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:04,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:39:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:04,820 INFO L225 Difference]: With dead ends: 47 [2019-03-04 16:39:04,820 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:39:04,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:39:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:39:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-03-04 16:39:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:39:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-03-04 16:39:04,830 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-03-04 16:39:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:04,831 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-03-04 16:39:04,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-03-04 16:39:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:39:04,831 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:04,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:39:04,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-03-04 16:39:04,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:04,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:04,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:04,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:39:04,887 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-03-04 16:39:04,889 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:04,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:04,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:04,899 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:04,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:04,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:04,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:04,900 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-03-04 16:39:04,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:04,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:04,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:04,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:04,932 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:04,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,947 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:04,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,969 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:04,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:04,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:05,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,019 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:05,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:05,122 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,158 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,180 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,199 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,226 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,269 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,359 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:05,360 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,370 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,385 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,441 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,462 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:05,520 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:05,574 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:05,574 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,610 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:05,611 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:05,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:39:05,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:39:05,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:05,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:05,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:05,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:39:05,667 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-03-04 16:39:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:05,730 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-03-04 16:39:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:39:05,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:39:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:05,731 INFO L225 Difference]: With dead ends: 23 [2019-03-04 16:39:05,732 INFO L226 Difference]: Without dead ends: 22 [2019-03-04 16:39:05,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:39:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-03-04 16:39:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-03-04 16:39:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:39:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-03-04 16:39:05,738 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-03-04 16:39:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:05,738 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-03-04 16:39:05,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-03-04 16:39:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:39:05,739 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:05,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:39:05,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-03-04 16:39:05,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:05,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:05,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:05,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:05,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:39:05,817 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-03-04 16:39:05,825 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:05,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:05,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:05,834 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:05,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:05,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,834 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-03-04 16:39:05,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:05,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:05,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:39:05,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:05,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:05,926 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,940 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,980 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,040 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,062 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,097 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,150 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:06,157 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:06,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:06,205 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:06,221 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:06,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:06,242 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,312 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,324 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,337 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,352 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,365 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,410 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:06,411 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:06,444 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:06,445 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,489 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:06,490 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:06,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:06,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:06,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:06,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:06,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:06,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:06,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:06,544 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-03-04 16:39:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:06,734 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-03-04 16:39:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:39:06,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:39:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:06,737 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:39:06,737 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:39:06,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:39:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-03-04 16:39:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:39:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-03-04 16:39:06,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-03-04 16:39:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:06,745 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-03-04 16:39:06,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-03-04 16:39:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:39:06,746 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:06,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:39:06,746 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-03-04 16:39:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:06,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:06,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:06,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:06,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:06,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:06,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:39:06,806 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-03-04 16:39:06,809 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:06,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:06,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:06,816 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:06,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:06,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:06,817 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-03-04 16:39:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:06,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:06,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:06,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:06,843 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:06,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,851 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:06,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:06,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:06,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:07,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,210 INFO L301 Elim1Store]: Index analysis took 215 ms [2019-03-04 16:39:07,373 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:07,375 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,386 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,400 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,415 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,430 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,474 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:07,535 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,542 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,550 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,563 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,582 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,626 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:07,627 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:07,701 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:07,701 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,732 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:07,732 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:07,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:07,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:07,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:07,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:07,778 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-03-04 16:39:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:08,072 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-03-04 16:39:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:08,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:39:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:08,074 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:39:08,075 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:39:08,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:39:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:39:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-03-04 16:39:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:39:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-03-04 16:39:08,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-03-04 16:39:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:08,083 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-03-04 16:39:08,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-03-04 16:39:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:08,084 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:08,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:08,085 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-03-04 16:39:08,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:08,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:08,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:08,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:08,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:08,150 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-03-04 16:39:08,152 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:08,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:08,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:08,157 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:08,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:08,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:08,158 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-03-04 16:39:08,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:08,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:08,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:08,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:08,182 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:08,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,193 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:08,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,201 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:08,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,223 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:08,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,252 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:08,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:08,307 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,320 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,333 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,347 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,359 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,403 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,463 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:08,464 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,478 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,490 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,504 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,544 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,595 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,596 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:08,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:08,669 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,720 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,720 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:08,915 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:39:08,916 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,934 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,934 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:09,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:09,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:09,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:09,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:09,019 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-03-04 16:39:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:09,487 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-03-04 16:39:09,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:09,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:09,489 INFO L225 Difference]: With dead ends: 61 [2019-03-04 16:39:09,489 INFO L226 Difference]: Without dead ends: 57 [2019-03-04 16:39:09,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-03-04 16:39:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-03-04 16:39:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:39:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-03-04 16:39:09,500 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-03-04 16:39:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:09,500 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-03-04 16:39:09,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-03-04 16:39:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:09,501 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:09,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:09,501 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-03-04 16:39:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:09,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:09,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:09,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:09,592 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-03-04 16:39:09,595 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:09,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:09,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:09,601 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:09,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,602 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-03-04 16:39:09,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:09,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:09,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:39:09,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:09,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:09,685 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,696 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,706 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,724 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,752 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,782 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,822 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:09,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:09,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:09,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:09,845 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:09,850 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:09,851 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,861 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,873 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,886 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,897 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,909 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,953 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:09,953 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:09,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:09,981 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,024 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:10,024 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:10,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:10,072 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,106 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:10,106 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:39:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:10,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:10,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:10,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:10,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:10,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:10,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:10,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:10,176 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-03-04 16:39:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:10,700 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-03-04 16:39:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:10,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:10,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:10,702 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:39:10,702 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:39:10,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:39:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-03-04 16:39:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:39:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-03-04 16:39:10,716 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-03-04 16:39:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:10,718 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-03-04 16:39:10,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-03-04 16:39:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:10,719 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:10,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:10,720 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-03-04 16:39:10,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:10,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:10,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:10,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:10,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:10,911 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-03-04 16:39:10,914 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:10,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:10,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:10,921 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:10,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:10,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,921 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-03-04 16:39:10,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:10,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:10,944 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:10,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,954 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:10,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:11,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:11,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:11,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,113 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:11,114 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,127 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,141 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,156 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,171 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,191 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:11,255 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,266 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,275 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,284 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,301 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,332 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,333 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:11,394 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:11,395 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,438 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,438 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:11,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:39:11,497 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,520 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:46 [2019-03-04 16:39:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:11,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:11,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:11,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:11,580 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-03-04 16:39:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:11,976 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-03-04 16:39:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:11,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:11,978 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:39:11,978 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:39:11,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:39:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-03-04 16:39:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:39:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-03-04 16:39:11,988 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-03-04 16:39:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:11,988 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-03-04 16:39:11,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-03-04 16:39:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:11,989 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:11,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:11,989 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-03-04 16:39:11,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:11,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:12,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:12,083 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-03-04 16:39:12,084 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:12,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:12,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:12,088 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:12,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,089 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-03-04 16:39:12,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:12,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:12,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:12,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:12,146 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,153 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,161 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,172 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,191 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:12,222 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:12,234 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:12,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:12,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:12,293 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:12,294 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,310 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,321 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,332 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,344 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,355 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,389 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,389 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:12,434 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:12,435 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,463 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:12,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:39:12,520 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,542 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,542 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:12,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:12,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:12,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:12,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:12,608 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-03-04 16:39:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:13,025 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-03-04 16:39:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:13,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:13,027 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:39:13,027 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:39:13,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:39:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-03-04 16:39:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:39:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-03-04 16:39:13,038 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-03-04 16:39:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:13,038 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-03-04 16:39:13,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-03-04 16:39:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:13,039 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:13,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:13,040 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-03-04 16:39:13,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:13,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:13,135 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-03-04 16:39:13,136 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:13,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:13,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:13,140 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:13,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,141 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-03-04 16:39:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:13,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,156 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:13,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:13,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:13,218 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,225 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,232 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,243 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,262 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,287 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:13,290 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:13,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:13,302 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:13,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:13,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:13,362 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,372 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,384 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,397 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,409 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,421 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,455 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,456 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:13,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:13,543 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,572 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,573 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:13,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:39:13,624 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,655 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,656 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:39:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:13,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:13,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:13,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:13,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:13,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:13,734 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-03-04 16:39:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:14,157 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-03-04 16:39:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:14,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:14,159 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:39:14,159 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:39:14,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:39:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-03-04 16:39:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:39:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-03-04 16:39:14,170 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-03-04 16:39:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:14,170 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-03-04 16:39:14,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-03-04 16:39:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:14,171 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:14,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:14,171 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-03-04 16:39:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:14,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:14,234 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-03-04 16:39:14,235 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:14,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:14,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:14,240 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:14,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,241 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-03-04 16:39:14,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:14,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:14,262 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:14,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,271 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:14,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:14,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:14,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:14,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:14,452 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,464 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,477 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,490 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,506 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,520 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:14,572 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,578 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,584 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,596 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,615 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,652 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:14,652 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:14,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:14,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,721 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:14,727 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,746 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:14,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:14,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:14,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:14,777 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-03-04 16:39:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:14,976 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-03-04 16:39:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:14,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:39:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:14,977 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:39:14,977 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:39:14,978 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-03-04 16:39:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:39:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-03-04 16:39:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:39:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-03-04 16:39:14,988 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-03-04 16:39:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:14,988 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-03-04 16:39:14,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-03-04 16:39:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:14,988 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:14,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:14,989 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-03-04 16:39:14,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:15,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:15,110 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-03-04 16:39:15,111 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:15,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:15,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:15,115 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:15,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:15,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,115 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-03-04 16:39:15,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:15,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:15,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:39:15,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:15,195 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:15,196 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,206 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,219 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,243 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,272 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,306 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,347 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:15,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:15,355 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:15,368 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:15,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:15,393 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:15,393 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,418 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,429 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,442 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,454 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,466 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,513 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:15,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:15,551 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,595 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,595 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:39:15,822 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-03-04 16:39:16,053 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:39:16,054 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,240 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:16,240 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:39:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:16,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:16,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:16,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:16,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:16,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:16,296 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-03-04 16:39:16,966 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-03-04 16:39:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:17,380 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-03-04 16:39:17,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:17,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:17,382 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:39:17,382 INFO L226 Difference]: Without dead ends: 93 [2019-03-04 16:39:17,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-03-04 16:39:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-03-04 16:39:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:39:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-03-04 16:39:17,397 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-03-04 16:39:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:17,397 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-03-04 16:39:17,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-03-04 16:39:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:17,398 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:17,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:17,399 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-03-04 16:39:17,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:17,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:17,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:17,486 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-03-04 16:39:17,487 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:17,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:17,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:17,491 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:17,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:17,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:17,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,492 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-03-04 16:39:17,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:17,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,512 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:17,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:17,520 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:17,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,525 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:17,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:17,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:17,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,581 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:17,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,664 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:17,665 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,685 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,698 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,711 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,724 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,738 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:17,792 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,798 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,807 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,822 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,840 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,872 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:17,914 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:17,915 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,940 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,941 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:17,991 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:39:17,992 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,013 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:18,013 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:39:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:18,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:18,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:18,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:18,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:18,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:18,072 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-03-04 16:39:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:18,526 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-03-04 16:39:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:18,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:18,528 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:39:18,528 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:39:18,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:39:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-03-04 16:39:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:39:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-03-04 16:39:18,543 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-03-04 16:39:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:18,543 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-03-04 16:39:18,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-03-04 16:39:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:18,544 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:18,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:18,545 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-03-04 16:39:18,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:18,717 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:39:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:18,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:18,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:18,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:18,728 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-03-04 16:39:18,729 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:18,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:18,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:18,733 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:18,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:18,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:18,734 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-03-04 16:39:18,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:18,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:18,750 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:39:18,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:18,760 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:18,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,766 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:18,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,778 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:18,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:18,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:18,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:18,865 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:18,866 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,897 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,914 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,929 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,944 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:18,958 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,091 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:19,092 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,094 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,104 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,119 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,138 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,166 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,211 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:19,211 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:19,237 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:19,238 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,280 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:19,280 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:19,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:19,322 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,357 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:19,358 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:39:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:19,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-03-04 16:39:19,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:19,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:19,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:19,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:19,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:19,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:19,417 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-03-04 16:39:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:22,215 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-03-04 16:39:22,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:22,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:22,218 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:39:22,218 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:39:22,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:39:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-03-04 16:39:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:39:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-03-04 16:39:22,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-03-04 16:39:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:22,258 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-03-04 16:39:22,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-03-04 16:39:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:22,264 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:22,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:22,264 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,265 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-03-04 16:39:22,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:22,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:22,417 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-03-04 16:39:22,419 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:22,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:22,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:22,425 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:22,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,426 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-03-04 16:39:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:22,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:22,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:22,495 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:22,667 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:39:22,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,773 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:22,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,926 INFO L301 Elim1Store]: Index analysis took 119 ms [2019-03-04 16:39:22,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:22,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,170 INFO L301 Elim1Store]: Index analysis took 204 ms [2019-03-04 16:39:23,184 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:23,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:23,447 INFO L301 Elim1Store]: Index analysis took 237 ms [2019-03-04 16:39:24,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:24,003 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,021 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,035 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,108 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,139 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,158 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,230 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:24,230 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,292 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,301 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,317 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,346 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:24,347 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-03-04 16:39:24,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:24,597 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:39:25,274 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:39:25,275 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:100 [2019-03-04 16:39:25,578 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2019-03-04 16:39:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:39:25,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:39:25,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:25,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:39:25,699 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-03-04 16:39:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:25,827 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-03-04 16:39:25,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:39:25,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:39:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:25,829 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:39:25,830 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:39:25,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:39:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:39:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-03-04 16:39:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-03-04 16:39:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-03-04 16:39:25,847 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-03-04 16:39:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:25,848 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-03-04 16:39:25,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-03-04 16:39:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:25,849 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:25,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:25,849 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:25,850 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-03-04 16:39:25,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:25,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:25,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:25,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:25,962 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-03-04 16:39:25,963 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:25,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:25,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:25,966 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:25,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:25,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,967 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:25,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:25,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,980 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:25,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:26,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:26,018 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,036 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,046 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,061 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,107 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,214 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:26,239 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:26,270 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:26,294 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:26,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:26,469 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:26,470 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,482 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,493 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,506 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,518 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,530 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,563 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:26,563 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:26,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:26,607 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,640 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:26,640 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:26,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:39:26,693 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,711 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:26,711 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:26,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:26,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:26,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:26,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:26,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:26,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:26,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:26,775 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-03-04 16:39:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:27,451 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-03-04 16:39:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:27,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:39:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:27,454 INFO L225 Difference]: With dead ends: 121 [2019-03-04 16:39:27,454 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:39:27,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:39:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-03-04 16:39:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:39:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-03-04 16:39:27,472 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-03-04 16:39:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:27,472 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-03-04 16:39:27,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-03-04 16:39:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:39:27,474 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:27,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:39:27,474 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-03-04 16:39:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:27,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:27,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:27,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:27,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:27,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:39:27,521 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-03-04 16:39:27,522 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:27,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:27,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:27,525 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:27,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:27,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:27,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:27,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:27,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:27,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:27,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:27,552 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:27,570 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:39:27,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,629 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:27,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,646 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:27,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:27,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:27,734 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,749 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,785 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,799 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,812 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,825 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,875 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:27,875 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,883 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,894 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,909 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,938 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:27,938 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:39:28,004 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:28,004 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,030 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,030 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:39:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:28,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:28,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:28,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:28,091 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-03-04 16:39:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:28,325 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-03-04 16:39:28,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:28,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:39:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:28,327 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:39:28,327 INFO L226 Difference]: Without dead ends: 109 [2019-03-04 16:39:28,328 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-03-04 16:39:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-03-04 16:39:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-03-04 16:39:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:39:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-03-04 16:39:28,342 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-03-04 16:39:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:28,342 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-03-04 16:39:28,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-03-04 16:39:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:28,344 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:28,344 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:39:28,344 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-03-04 16:39:28,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:28,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:28,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:28,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,445 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:28,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:28,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:28,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:28,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:28,498 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:39:28,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:28,505 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:28,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,511 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:28,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:28,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,538 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:28,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:28,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,587 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:28,587 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,601 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,615 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,629 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,643 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,655 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,752 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:28,752 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,898 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,062 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,270 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,558 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,584 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,630 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,630 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:29,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:29,651 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,695 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,695 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:29,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 65 [2019-03-04 16:39:29,766 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,806 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,806 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:73 [2019-03-04 16:39:29,864 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:29,865 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,899 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:39:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:29,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:29,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:29,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:29,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:29,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:29,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:29,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:29,960 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-03-04 16:39:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:30,608 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-03-04 16:39:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:30,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:30,611 INFO L225 Difference]: With dead ends: 133 [2019-03-04 16:39:30,611 INFO L226 Difference]: Without dead ends: 128 [2019-03-04 16:39:30,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-03-04 16:39:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-03-04 16:39:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-03-04 16:39:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-03-04 16:39:30,637 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-03-04 16:39:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:30,638 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-03-04 16:39:30,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-03-04 16:39:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:30,639 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:30,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:30,640 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-03-04 16:39:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:30,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:30,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:30,720 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-03-04 16:39:30,722 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:30,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:30,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:30,725 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:30,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:30,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,726 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:30,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:30,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:30,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:30,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:30,750 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:30,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,754 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:30,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:30,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:30,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:30,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:30,854 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,867 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,916 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,928 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,941 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,954 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:31,000 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,007 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,019 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,033 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,053 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,084 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:31,085 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:31,242 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-03-04 16:39:31,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:31,248 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,276 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:31,276 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:31,307 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:39:31,308 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,326 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:31,326 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:31,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:31,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:31,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:31,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:31,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:31,385 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-03-04 16:39:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:31,719 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-03-04 16:39:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:31,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:31,722 INFO L225 Difference]: With dead ends: 125 [2019-03-04 16:39:31,722 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:39:31,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:39:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-03-04 16:39:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-03-04 16:39:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-03-04 16:39:31,741 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-03-04 16:39:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:31,741 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-03-04 16:39:31,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-03-04 16:39:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:31,742 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:31,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:31,742 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-03-04 16:39:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:31,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:31,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:31,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:31,897 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-03-04 16:39:31,899 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:31,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:31,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:31,902 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:31,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:31,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:31,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:31,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:31,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:31,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:39:31,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:32,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:32,041 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,073 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,159 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,177 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,196 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,224 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,262 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:32,265 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:32,269 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:32,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:32,278 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:32,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:32,283 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,294 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,305 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,316 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,329 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,341 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,385 INFO L309 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-03-04 16:39:32,386 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:32,420 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:32,421 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,463 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,463 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:32,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:32,544 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,575 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,576 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:39:32,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:39:32,669 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,693 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,693 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:39:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:32,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:32,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:32,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:32,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:32,776 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-03-04 16:39:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:34,408 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-03-04 16:39:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:34,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:34,411 INFO L225 Difference]: With dead ends: 149 [2019-03-04 16:39:34,411 INFO L226 Difference]: Without dead ends: 145 [2019-03-04 16:39:34,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-03-04 16:39:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-03-04 16:39:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-03-04 16:39:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-03-04 16:39:34,432 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-03-04 16:39:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:34,432 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-03-04 16:39:34,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-03-04 16:39:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:34,433 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:34,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:34,433 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-03-04 16:39:34,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:34,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:34,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:34,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:34,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:34,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:34,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:34,554 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:34,554 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-03-04 16:39:34,556 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:34,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:34,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:34,559 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:34,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:34,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:34,560 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:34,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:34,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:34,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:34,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:34,578 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:34,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,581 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:34,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:34,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:34,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:34,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,669 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:34,670 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,683 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,697 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,710 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,723 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,736 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:34,782 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,788 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,797 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,808 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,825 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,857 INFO L309 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-03-04 16:39:34,858 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:34,913 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:34,913 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,940 INFO L309 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-03-04 16:39:34,940 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:35,001 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:39:35,001 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,020 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:35,021 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:35,068 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:39:35,069 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,085 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:35,086 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:39:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:35,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:35,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:35,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:35,175 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-03-04 16:39:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:35,703 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-03-04 16:39:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:35,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:35,706 INFO L225 Difference]: With dead ends: 138 [2019-03-04 16:39:35,706 INFO L226 Difference]: Without dead ends: 136 [2019-03-04 16:39:35,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-03-04 16:39:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-03-04 16:39:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-03-04 16:39:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-03-04 16:39:35,727 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-03-04 16:39:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:35,728 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-03-04 16:39:35,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-03-04 16:39:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:35,728 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:35,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:35,729 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:35,729 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-03-04 16:39:35,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:35,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:35,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:35,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:35,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:35,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:35,836 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:35,837 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-03-04 16:39:35,838 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:35,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:35,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:35,842 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:35,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:35,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:35,842 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:35,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:35,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:35,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:39:35,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:35,919 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:35,920 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,926 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,939 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,957 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,978 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,020 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,056 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:36,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:36,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:36,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:36,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:36,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:36,078 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,089 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,101 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,112 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,124 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,136 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,181 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:36,181 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:36,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:36,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,250 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:36,251 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:36,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:36,289 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,320 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:36,320 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:39:36,373 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 45 treesize of output 54 [2019-03-04 16:39:36,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:36,403 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:36,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-03-04 16:39:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:36,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:36,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:36,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:36,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:36,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:36,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:36,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:36,469 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-03-04 16:39:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:37,061 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-03-04 16:39:37,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:37,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:37,066 INFO L225 Difference]: With dead ends: 152 [2019-03-04 16:39:37,067 INFO L226 Difference]: Without dead ends: 151 [2019-03-04 16:39:37,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-03-04 16:39:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-03-04 16:39:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-03-04 16:39:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-03-04 16:39:37,088 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-03-04 16:39:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:37,088 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-03-04 16:39:37,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-03-04 16:39:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:37,089 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:37,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:37,089 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-03-04 16:39:37,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:37,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:37,299 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-03-04 16:39:37,300 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:37,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:37,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:37,303 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:37,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:37,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,304 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:37,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:37,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:37,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:39:37,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:37,384 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:37,385 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,393 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,404 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,417 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,438 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,476 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:37,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:37,527 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:37,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:37,535 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:37,540 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:37,541 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,551 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,561 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,573 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,601 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,613 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,656 INFO L309 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-03-04 16:39:37,657 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:37,690 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:37,691 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,739 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,739 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:37,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:39:37,782 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,814 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,815 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:39:37,875 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 45 treesize of output 54 [2019-03-04 16:39:37,876 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,904 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,904 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:61 [2019-03-04 16:39:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:37,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:37,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:37,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:37,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:37,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:37,988 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-03-04 16:39:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:38,678 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-03-04 16:39:38,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:38,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:38,681 INFO L225 Difference]: With dead ends: 141 [2019-03-04 16:39:38,681 INFO L226 Difference]: Without dead ends: 140 [2019-03-04 16:39:38,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-03-04 16:39:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-03-04 16:39:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-03-04 16:39:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-03-04 16:39:38,705 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-03-04 16:39:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:38,705 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-03-04 16:39:38,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-03-04 16:39:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:38,706 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:38,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:38,707 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-03-04 16:39:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:38,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:39,142 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-03-04 16:39:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:39,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:39,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:39,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:39,406 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-03-04 16:39:39,407 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:39,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:39,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:39,409 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:39,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:39,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:39,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:39,410 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:39,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:39,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:39,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:39,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:39,431 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:39,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,436 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:39,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,447 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:39,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,461 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:39,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,477 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:39,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,529 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:39,530 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,541 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,556 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,569 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,583 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,596 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:39,700 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,706 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,715 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,731 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,749 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,781 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:39,781 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:39,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:39,846 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,971 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:39,972 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:40,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:39:40,003 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,025 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:40,026 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:46 [2019-03-04 16:39:40,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 41 [2019-03-04 16:39:40,072 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,087 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:40,088 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:39:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:40,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:40,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:40,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:40,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:40,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:40,151 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-03-04 16:39:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:40,792 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-03-04 16:39:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:40,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:40,796 INFO L225 Difference]: With dead ends: 163 [2019-03-04 16:39:40,797 INFO L226 Difference]: Without dead ends: 162 [2019-03-04 16:39:40,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-03-04 16:39:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-03-04 16:39:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-03-04 16:39:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-03-04 16:39:40,818 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-03-04 16:39:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:40,818 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-03-04 16:39:40,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-03-04 16:39:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:40,818 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:40,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:40,819 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:40,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-03-04 16:39:40,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:40,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:40,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:40,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:40,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:41,002 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:39:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:41,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:41,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:41,043 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-03-04 16:39:41,045 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:41,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:41,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:41,048 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:41,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:41,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,049 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:41,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:41,080 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:39:41,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:41,176 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:41,177 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,190 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,204 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,220 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,243 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,274 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:41,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:41,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:41,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:41,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:41,373 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:41,374 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,423 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,434 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,447 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,460 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,473 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,526 INFO L309 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-03-04 16:39:41,527 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:41,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:41,573 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,617 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:41,617 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:39:41,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:39:41,662 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,694 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:41,694 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:39:41,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:39:41,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,775 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:41,776 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:39:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:41,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:41,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:41,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:41,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:41,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:41,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:41,873 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-03-04 16:39:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:42,801 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-03-04 16:39:42,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:42,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:42,804 INFO L225 Difference]: With dead ends: 163 [2019-03-04 16:39:42,804 INFO L226 Difference]: Without dead ends: 160 [2019-03-04 16:39:42,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-03-04 16:39:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-03-04 16:39:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-03-04 16:39:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-03-04 16:39:42,825 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-03-04 16:39:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:42,825 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-03-04 16:39:42,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-03-04 16:39:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:42,826 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:42,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:42,827 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:42,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-03-04 16:39:42,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:42,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:42,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:42,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:42,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:42,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:42,964 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-03-04 16:39:42,965 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:42,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:42,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:42,968 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:42,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:42,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:42,969 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:42,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:42,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:42,982 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:42,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:43,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:43,010 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,021 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,032 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,050 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,068 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:43,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:43,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:43,101 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:43,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:43,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:43,144 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,154 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,166 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,178 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,188 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,199 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,231 INFO L309 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-03-04 16:39:43,231 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:43,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:43,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,308 INFO L309 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-03-04 16:39:43,309 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:39:43,347 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:39:43,348 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,368 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:39:43,419 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:39:43,419 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,437 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,438 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:39:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:43,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:43,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:43,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:43,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:43,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:43,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:43,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:43,514 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-03-04 16:39:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:44,020 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-03-04 16:39:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:44,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:44,023 INFO L225 Difference]: With dead ends: 165 [2019-03-04 16:39:44,023 INFO L226 Difference]: Without dead ends: 163 [2019-03-04 16:39:44,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-03-04 16:39:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-03-04 16:39:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-03-04 16:39:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-03-04 16:39:44,050 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-03-04 16:39:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:44,050 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-03-04 16:39:44,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-03-04 16:39:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:44,051 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:44,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:44,052 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-03-04 16:39:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:44,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:44,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:44,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:44,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:44,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:44,124 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-03-04 16:39:44,126 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:44,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:44,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:44,129 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:44,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:44,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:44,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:44,129 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:44,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:44,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:44,153 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:44,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:44,159 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:44,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,166 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:44,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:44,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:44,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:44,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,294 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:44,294 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,310 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,332 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,349 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,365 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,380 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:44,452 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,466 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,502 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,529 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,554 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,600 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:44,653 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:44,654 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,697 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:44,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:44,731 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:39:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:44,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:44,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:44,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:39:44,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:44,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:39:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:39:44,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:44,843 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-03-04 16:39:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:45,133 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-03-04 16:39:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:45,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-03-04 16:39:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:45,136 INFO L225 Difference]: With dead ends: 158 [2019-03-04 16:39:45,136 INFO L226 Difference]: Without dead ends: 156 [2019-03-04 16:39:45,137 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-03-04 16:39:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-03-04 16:39:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-03-04 16:39:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-03-04 16:39:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-03-04 16:39:45,165 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-03-04 16:39:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:45,165 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-03-04 16:39:45,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:39:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-03-04 16:39:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:45,166 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:45,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:45,167 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-03-04 16:39:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:45,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:45,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:45,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:45,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:45,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:45,266 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:45,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:45,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:45,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:45,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:45,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:39:45,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:45,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:39:45,323 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,331 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,340 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,354 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,377 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,406 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:45,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:45,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:45,456 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:45,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:45,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:39:45,465 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,477 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,489 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,500 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,512 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,524 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,568 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,568 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:39:45,599 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:39:45,600 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,643 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:39:45,681 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:39:45,682 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,715 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,715 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:39:45,779 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:39:45,780 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,806 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:39:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:45,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:45,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:45,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-03-04 16:39:45,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:45,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:45,869 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-03-04 16:39:46,350 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-03-04 16:39:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:46,731 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-03-04 16:39:46,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:46,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:46,734 INFO L225 Difference]: With dead ends: 241 [2019-03-04 16:39:46,734 INFO L226 Difference]: Without dead ends: 235 [2019-03-04 16:39:46,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-03-04 16:39:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-03-04 16:39:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-03-04 16:39:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-03-04 16:39:46,772 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-03-04 16:39:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:46,772 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-03-04 16:39:46,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-03-04 16:39:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:46,773 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:46,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:46,773 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-03-04 16:39:46,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:46,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:46,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:47,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:47,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:47,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:47,153 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-03-04 16:39:47,153 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:47,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:47,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:47,156 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:47,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:47,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:47,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:47,157 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:47,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:47,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:47,209 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:47,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:47,236 INFO L453 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 21 treesize of output 24 [2019-03-04 16:39:47,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,239 INFO L453 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 24 treesize of output 26 [2019-03-04 16:39:47,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:47,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,258 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:47,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:47,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,331 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:47,331 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,343 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,356 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,369 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,382 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,394 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:47,438 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,443 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,454 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,470 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,487 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,518 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,519 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:47,759 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-03-04 16:39:47,778 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:39:47,779 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:39:47,828 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:39:47,828 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-03-04 16:39:48,042 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-03-04 16:39:48,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 83 [2019-03-04 16:39:48,148 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,272 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 65 treesize of output 91 [2019-03-04 16:39:48,279 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-03-04 16:39:48,501 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-03-04 16:39:48,502 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:332 [2019-03-04 16:39:49,298 WARN L181 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 101 [2019-03-04 16:39:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:49,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:49,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:49,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:49,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:49,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:49,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:49,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:49,353 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-03-04 16:39:49,801 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-03-04 16:39:50,966 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-03-04 16:39:51,249 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2019-03-04 16:39:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:53,665 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-03-04 16:39:53,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:53,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:53,668 INFO L225 Difference]: With dead ends: 208 [2019-03-04 16:39:53,668 INFO L226 Difference]: Without dead ends: 207 [2019-03-04 16:39:53,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-03-04 16:39:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-03-04 16:39:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-03-04 16:39:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-03-04 16:39:53,709 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-03-04 16:39:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:53,710 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-03-04 16:39:53,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-03-04 16:39:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:53,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:53,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:53,711 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-03-04 16:39:53,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:53,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:53,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:53,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:53,804 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-03-04 16:39:53,805 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:53,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:53,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:53,808 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:53,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:53,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:53,808 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:53,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:53,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:53,821 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:39:53,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:53,852 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:53,852 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,862 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,869 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,886 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,904 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:53,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:53,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:53,949 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:53,952 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:53,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:53,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:53,995 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,007 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,018 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,028 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,040 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,052 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,084 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:54,084 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:54,322 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-03-04 16:39:54,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:39:54,428 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:39:54,476 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-03-04 16:39:54,477 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-03-04 16:39:54,747 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-03-04 16:39:54,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 65 treesize of output 70 [2019-03-04 16:39:54,813 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:39:55,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65 [2019-03-04 16:39:55,001 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,072 INFO L309 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-03-04 16:39:55,072 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:129 [2019-03-04 16:39:55,292 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-03-04 16:39:55,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 55 treesize of output 81 [2019-03-04 16:39:55,366 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:39:55,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:39:55,593 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 61 [2019-03-04 16:39:55,788 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,915 INFO L309 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-03-04 16:39:55,915 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:258 [2019-03-04 16:39:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:56,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:56,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:56,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:56,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:56,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:56,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:56,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:56,109 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-03-04 16:39:56,715 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-03-04 16:39:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:57,334 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-03-04 16:39:57,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:39:57,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:57,339 INFO L225 Difference]: With dead ends: 280 [2019-03-04 16:39:57,339 INFO L226 Difference]: Without dead ends: 279 [2019-03-04 16:39:57,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-03-04 16:39:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-03-04 16:39:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:39:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-03-04 16:39:57,383 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-03-04 16:39:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:57,384 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-03-04 16:39:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-03-04 16:39:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:57,384 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:57,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:57,385 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-03-04 16:39:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:57,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:57,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,752 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-03-04 16:39:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:57,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:39:57,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:39:57,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:57,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:57,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:57,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:39:57,754 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-03-04 16:39:57,915 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-03-04 16:39:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:58,315 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-03-04 16:39:58,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:39:58,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:39:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:58,319 INFO L225 Difference]: With dead ends: 201 [2019-03-04 16:39:58,320 INFO L226 Difference]: Without dead ends: 198 [2019-03-04 16:39:58,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:39:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-03-04 16:39:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-03-04 16:39:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-03-04 16:39:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-03-04 16:39:58,364 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-03-04 16:39:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:58,365 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-03-04 16:39:58,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-03-04 16:39:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:58,366 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:58,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:58,366 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-03-04 16:39:58,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:58,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:58,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:58,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:58,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:58,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:58,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:58,443 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-03-04 16:39:58,444 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:58,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:58,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:58,446 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:58,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:58,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:58,447 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:58,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:58,463 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:39:58,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:58,500 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:39:58,500 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,502 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,515 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,533 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,557 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:58,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:39:58,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:58,600 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:58,603 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:58,640 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:58,641 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,651 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,662 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,674 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,684 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,694 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,725 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:58,726 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:39:58,762 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:58,763 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,790 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:58,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:39:58,822 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:58,823 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,844 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:58,845 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:39:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:58,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:58,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:58,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:58,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:58,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:58,904 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-03-04 16:39:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:59,238 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-03-04 16:39:59,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:59,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:59,241 INFO L225 Difference]: With dead ends: 208 [2019-03-04 16:39:59,241 INFO L226 Difference]: Without dead ends: 207 [2019-03-04 16:39:59,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-03-04 16:39:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-03-04 16:39:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-03-04 16:39:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-03-04 16:39:59,281 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-03-04 16:39:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:59,282 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-03-04 16:39:59,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-03-04 16:39:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:59,283 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:59,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:59,283 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:59,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:59,283 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-03-04 16:39:59,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:59,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:59,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:59,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:59,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:59,445 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:59,446 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-03-04 16:39:59,447 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:59,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:59,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:59,450 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:59,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:59,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:59,450 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:59,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:59,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:59,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:59,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:59,498 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:39:59,498 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,509 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,527 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,550 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,578 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:39:59,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:39:59,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:39:59,611 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:39:59,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:39:59,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:59,662 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,681 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,694 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,710 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,744 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,759 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,795 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:59,795 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:39:59,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:59,848 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,887 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:59,887 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:39:59,954 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:39:59,954 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,981 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:59,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:36 [2019-03-04 16:40:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:00,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:00,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:00,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:00,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:00,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:00,103 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-03-04 16:40:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:00,400 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-03-04 16:40:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:00,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:40:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:00,403 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:40:00,404 INFO L226 Difference]: Without dead ends: 208 [2019-03-04 16:40:00,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-03-04 16:40:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-03-04 16:40:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-03-04 16:40:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-03-04 16:40:00,444 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-03-04 16:40:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:00,444 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-03-04 16:40:00,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-03-04 16:40:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:00,445 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:00,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:00,445 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-03-04 16:40:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:00,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:00,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:00,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:00,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:00,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,539 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:00,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:00,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:00,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:00,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:00,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:40:00,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:00,602 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:00,603 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,608 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,617 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,632 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,656 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,689 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,728 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:40:00,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:40:00,738 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:00,741 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:00,745 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:00,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:00,759 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,780 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,795 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,805 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,817 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,829 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,874 INFO L309 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-03-04 16:40:00,874 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:00,911 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:00,912 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,954 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:00,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:01,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:01,001 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,034 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:01,035 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:40:01,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:40:01,088 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,113 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:01,113 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:40:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:01,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:01,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:01,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:01,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:01,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:01,201 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-03-04 16:40:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:02,810 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-03-04 16:40:02,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:02,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:40:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:02,814 INFO L225 Difference]: With dead ends: 242 [2019-03-04 16:40:02,814 INFO L226 Difference]: Without dead ends: 240 [2019-03-04 16:40:02,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-03-04 16:40:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-03-04 16:40:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-03-04 16:40:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-03-04 16:40:02,859 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-03-04 16:40:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:02,859 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-03-04 16:40:02,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-03-04 16:40:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:02,860 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:02,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:02,861 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-03-04 16:40:02,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:02,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:02,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:02,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:02,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:02,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:02,933 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-03-04 16:40:02,934 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:02,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:02,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:02,937 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:02,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:02,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:02,937 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:02,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:02,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:02,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:40:02,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:02,957 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:02,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,964 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:02,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:02,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:03,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:03,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,041 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:03,042 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,055 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,069 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,083 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,097 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,111 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,170 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:03,171 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,175 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,187 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,207 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,233 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,261 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,306 INFO L309 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-03-04 16:40:03,307 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:03,340 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:03,341 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,383 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:03,384 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:03,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:40:03,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,454 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:03,455 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:40:03,506 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:40:03,507 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,532 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:03,533 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:40:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:03,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:03,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:03,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:03,618 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-03-04 16:40:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:04,281 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-03-04 16:40:04,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:04,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:40:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:04,283 INFO L225 Difference]: With dead ends: 249 [2019-03-04 16:40:04,283 INFO L226 Difference]: Without dead ends: 247 [2019-03-04 16:40:04,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-03-04 16:40:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-03-04 16:40:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-03-04 16:40:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-03-04 16:40:04,316 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-03-04 16:40:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:04,316 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-03-04 16:40:04,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-03-04 16:40:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:04,317 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:04,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:04,318 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-03-04 16:40:04,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:04,470 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-03-04 16:40:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:04,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:04,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:04,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:04,501 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-03-04 16:40:04,504 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:04,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:04,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:04,506 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:04,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:04,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:04,507 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:04,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:04,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:04,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:04,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:04,528 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:04,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,534 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:04,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:04,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:04,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:04,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:04,624 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:04,625 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,638 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,651 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,663 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,675 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,688 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:04,733 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,739 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,750 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,766 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,804 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,844 INFO L309 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-03-04 16:40:04,844 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:40:04,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:04,912 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:04,948 INFO L309 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-03-04 16:40:04,948 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:40:04,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:40:04,999 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,024 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,025 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:40:05,122 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:40:05,122 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,146 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:40:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:05,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:05,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:05,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:05,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:05,239 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-03-04 16:40:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:05,752 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-03-04 16:40:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:05,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:40:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:05,756 INFO L225 Difference]: With dead ends: 260 [2019-03-04 16:40:05,756 INFO L226 Difference]: Without dead ends: 258 [2019-03-04 16:40:05,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:40:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-03-04 16:40:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-03-04 16:40:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:40:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-03-04 16:40:05,793 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-03-04 16:40:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:05,793 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-03-04 16:40:05,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-03-04 16:40:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:05,794 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:05,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:05,794 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-03-04 16:40:05,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,931 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:40:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:05,973 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:05,973 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-03-04 16:40:05,974 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:05,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:05,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:05,977 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:05,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,978 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:05,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:40:05,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:05,996 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:06,008 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:06,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,016 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:06,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:06,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,046 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:06,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:06,071 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,085 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,099 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,112 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,125 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,137 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:06,191 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,198 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,209 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,229 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,254 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:06,297 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:40:06,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:06,326 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,369 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:06,369 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-03-04 16:40:06,415 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:06,416 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,478 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:06,479 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-03-04 16:40:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:06,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:06,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:06,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:06,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:06,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:06,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:06,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:06,540 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-03-04 16:40:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:06,849 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-03-04 16:40:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:06,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:40:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:06,853 INFO L225 Difference]: With dead ends: 244 [2019-03-04 16:40:06,853 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 16:40:06,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 16:40:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-03-04 16:40:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:40:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-03-04 16:40:06,899 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-03-04 16:40:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:06,899 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-03-04 16:40:06,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-03-04 16:40:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:06,900 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:06,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:06,900 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-03-04 16:40:06,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:06,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:07,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:07,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:07,069 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:07,069 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-03-04 16:40:07,069 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:07,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:07,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:07,073 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:07,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:07,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:07,073 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:07,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:07,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:07,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:07,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:07,095 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:07,112 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:07,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,122 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:07,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,132 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:07,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:07,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,200 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:07,201 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,213 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,226 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,239 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,252 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,265 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,398 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:07,398 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,501 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,513 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,529 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,557 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,557 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:40:07,795 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-03-04 16:40:07,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 41 treesize of output 71 [2019-03-04 16:40:07,852 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:40:08,089 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-03-04 16:40:08,090 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:437 [2019-03-04 16:40:08,278 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 92 [2019-03-04 16:40:08,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2019-03-04 16:40:08,316 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 81 [2019-03-04 16:40:08,465 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:40:08,551 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,612 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-03-04 16:40:08,613 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:198, output treesize:126 [2019-03-04 16:40:08,755 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-03-04 16:40:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:08,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:08,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:08,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:08,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:08,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:08,813 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-03-04 16:40:09,203 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-03-04 16:40:09,543 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-03-04 16:40:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:20,273 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-03-04 16:40:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:20,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:40:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:20,276 INFO L225 Difference]: With dead ends: 273 [2019-03-04 16:40:20,276 INFO L226 Difference]: Without dead ends: 272 [2019-03-04 16:40:20,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:40:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-03-04 16:40:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-03-04 16:40:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-03-04 16:40:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-03-04 16:40:20,322 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-03-04 16:40:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:20,322 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-03-04 16:40:20,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-03-04 16:40:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:20,322 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:20,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:20,323 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-03-04 16:40:20,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:20,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:20,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:20,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:20,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:20,503 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-03-04 16:40:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:20,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:20,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:20,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:20,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:20,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:20,527 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:20,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:20,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:20,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:20,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:20,542 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:40:20,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:20,548 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:20,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,553 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:20,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,561 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:20,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:20,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:20,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:20,613 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:20,613 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,627 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,641 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,655 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,667 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,682 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,742 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:20,742 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,747 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,756 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,774 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,800 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,828 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:20,872 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:20,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:20,902 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:20,945 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:20,945 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:20,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:20,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,019 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:21,020 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:40:21,074 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 45 treesize of output 46 [2019-03-04 16:40:21,075 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,098 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:21,098 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-03-04 16:40:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:21,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:21,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:21,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:40:21,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:21,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:21,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:21,165 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-03-04 16:40:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:21,787 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-03-04 16:40:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:21,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:40:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:21,791 INFO L225 Difference]: With dead ends: 274 [2019-03-04 16:40:21,791 INFO L226 Difference]: Without dead ends: 273 [2019-03-04 16:40:21,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-03-04 16:40:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-03-04 16:40:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-03-04 16:40:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-03-04 16:40:21,829 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-03-04 16:40:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:21,830 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-03-04 16:40:21,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-03-04 16:40:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:21,831 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:21,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:21,831 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-03-04 16:40:21,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:21,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:21,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:21,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:21,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:22,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:22,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:22,002 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-03-04 16:40:22,003 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:22,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:22,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:22,006 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:22,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:22,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,007 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:22,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:22,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:22,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:22,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:22,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:22,134 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,139 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,152 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,171 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,198 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:40:22,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:22,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:22,261 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:22,267 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:22,274 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:22,274 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,286 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,298 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,311 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,324 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,336 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,380 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:22,380 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-03-04 16:40:22,402 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:22,402 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,443 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:22,443 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:69 [2019-03-04 16:40:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:22,460 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:22,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:22,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:22,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:22,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:22,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:22,489 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-03-04 16:40:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:22,698 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-03-04 16:40:22,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:22,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:40:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:22,701 INFO L225 Difference]: With dead ends: 242 [2019-03-04 16:40:22,701 INFO L226 Difference]: Without dead ends: 241 [2019-03-04 16:40:22,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-03-04 16:40:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-03-04 16:40:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-03-04 16:40:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-03-04 16:40:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-03-04 16:40:22,747 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-03-04 16:40:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:22,747 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-03-04 16:40:22,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-03-04 16:40:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:22,748 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:22,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:22,748 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-03-04 16:40:22,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:22,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:22,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:22,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:22,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:22,910 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-03-04 16:40:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:22,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:22,944 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:22,944 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-03-04 16:40:22,945 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:22,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:22,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:22,947 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:22,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:22,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,948 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:22,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:22,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:22,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:40:22,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:23,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:23,021 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,027 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,036 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,055 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,081 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,110 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:40:23,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:40:23,153 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:23,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:23,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:23,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:23,165 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,176 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,188 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,200 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,212 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,223 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,268 INFO L309 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-03-04 16:40:23,268 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:23,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:23,305 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,346 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:23,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:23,387 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:23,387 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,419 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:23,419 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:40:23,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:40:23,475 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,500 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:23,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:40:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:23,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:23,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:23,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:23,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:23,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:23,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:23,578 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-03-04 16:40:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:24,198 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-03-04 16:40:24,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:24,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:40:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:24,202 INFO L225 Difference]: With dead ends: 276 [2019-03-04 16:40:24,202 INFO L226 Difference]: Without dead ends: 274 [2019-03-04 16:40:24,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-03-04 16:40:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-03-04 16:40:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-03-04 16:40:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-03-04 16:40:24,242 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-03-04 16:40:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:24,243 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-03-04 16:40:24,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-03-04 16:40:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:24,243 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:24,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:24,244 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-03-04 16:40:24,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:24,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:24,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:24,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:24,425 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:24,425 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-03-04 16:40:24,426 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:24,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:24,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:24,429 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:24,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:24,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:24,429 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:24,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:24,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:40:24,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:24,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:24,473 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,478 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,484 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,497 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,515 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,541 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:40:24,545 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:40:24,548 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:24,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:24,558 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:24,595 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:24,596 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,606 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,616 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,628 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,640 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,652 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,684 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,684 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:40:24,721 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:24,721 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,750 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:40:24,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:40:24,781 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,800 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:40:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:24,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:24,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:24,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:24,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:24,892 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-03-04 16:40:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:25,296 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-03-04 16:40:25,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:25,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:40:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:25,300 INFO L225 Difference]: With dead ends: 288 [2019-03-04 16:40:25,300 INFO L226 Difference]: Without dead ends: 287 [2019-03-04 16:40:25,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-03-04 16:40:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-03-04 16:40:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-03-04 16:40:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-03-04 16:40:25,358 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-03-04 16:40:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:25,359 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-03-04 16:40:25,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-03-04 16:40:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:40:25,360 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:25,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:40:25,360 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:25,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:25,360 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-03-04 16:40:25,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:25,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:25,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:25,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:25,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:25,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:25,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:25,471 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:40:25,472 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-03-04 16:40:25,472 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:25,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:25,475 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:25,475 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:25,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:25,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:25,476 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:25,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:25,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:25,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:25,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:25,495 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:25,514 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:25,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,526 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:25,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:25,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,569 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:25,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:25,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:25,679 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,691 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,703 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,716 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,729 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,742 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:25,781 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,787 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,796 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,812 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:25,841 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:25,842 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:40:26,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:26,070 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:26,368 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:26,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:40:26,409 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:40:26,410 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,425 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:26,425 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:27 [2019-03-04 16:40:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:26,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:26,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:26,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:40:26,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:26,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:26,471 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-03-04 16:40:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:26,866 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-03-04 16:40:26,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:26,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:40:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:26,870 INFO L225 Difference]: With dead ends: 319 [2019-03-04 16:40:26,870 INFO L226 Difference]: Without dead ends: 318 [2019-03-04 16:40:26,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-03-04 16:40:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-03-04 16:40:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-03-04 16:40:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-03-04 16:40:26,928 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-03-04 16:40:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:26,928 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-03-04 16:40:26,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-03-04 16:40:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:26,929 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:26,929 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:40:26,930 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:26,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:26,930 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-03-04 16:40:26,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:26,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:26,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:26,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:26,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:26,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:26,971 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-03-04 16:40:26,972 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:26,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:26,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:26,975 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:26,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:26,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:26,976 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:26,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:26,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:26,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:26,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:27,024 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:27,024 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,037 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,053 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,077 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,100 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:40:27,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:27,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:27,128 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:27,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:27,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:27,172 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,183 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,194 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,206 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,217 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,229 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,259 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:27,259 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:40:27,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:27,291 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,317 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:27,317 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:40:27,373 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 38 treesize of output 57 [2019-03-04 16:40:27,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,397 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:27,397 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-03-04 16:40:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:27,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:27,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:40:27,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:27,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:40:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:40:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:27,452 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-03-04 16:40:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:27,656 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-03-04 16:40:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:27,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:40:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:27,660 INFO L225 Difference]: With dead ends: 290 [2019-03-04 16:40:27,661 INFO L226 Difference]: Without dead ends: 289 [2019-03-04 16:40:27,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-03-04 16:40:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-03-04 16:40:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-03-04 16:40:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-03-04 16:40:27,745 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-03-04 16:40:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:27,746 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-03-04 16:40:27,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:40:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-03-04 16:40:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:27,747 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:27,747 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-03-04 16:40:27,747 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-03-04 16:40:27,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:27,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:27,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:27,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:27,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:27,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:27,915 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:27,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:27,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:27,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:27,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:27,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:27,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:27,935 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:27,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,942 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:27,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,950 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:27,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,965 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:27,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,981 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:27,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:28,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:28,032 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,043 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,055 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,069 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,081 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,094 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,138 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:28,138 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,140 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,149 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,160 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,178 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,210 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:28,210 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:40:28,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:28,242 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,271 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:28,272 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:40:28,298 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:40:28,298 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,317 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:28,318 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:40:28,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 38 treesize of output 49 [2019-03-04 16:40:28,376 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,392 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:28,392 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:28,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 38 treesize of output 57 [2019-03-04 16:40:28,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:28,473 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:28,473 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:28,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:28,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:28,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:40:28,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:28,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:40:28,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:40:28,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:40:28,543 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-03-04 16:40:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:29,103 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-03-04 16:40:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:40:29,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:40:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:29,108 INFO L225 Difference]: With dead ends: 423 [2019-03-04 16:40:29,108 INFO L226 Difference]: Without dead ends: 421 [2019-03-04 16:40:29,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-03-04 16:40:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-03-04 16:40:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-03-04 16:40:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-03-04 16:40:29,182 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-03-04 16:40:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:29,183 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-03-04 16:40:29,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:40:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-03-04 16:40:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:29,184 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:29,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:29,184 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-03-04 16:40:29,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:29,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:29,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:29,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:29,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:29,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:29,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:29,281 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-03-04 16:40:29,282 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:29,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:29,285 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:29,286 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:29,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:29,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:29,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:29,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,301 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:40:29,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:29,307 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:29,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,321 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:29,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,327 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:29,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,339 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:29,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,356 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:29,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,378 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:29,379 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,392 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,406 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,420 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,433 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,447 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:29,504 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,510 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,521 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,538 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,556 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,584 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,630 INFO L309 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-03-04 16:40:29,631 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:29,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:29,663 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,708 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:29,708 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:29,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:29,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,783 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:29,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:40:29,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:40:29,839 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,864 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:29,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-03-04 16:40:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:29,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:29,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:29,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:29,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:29,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:29,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:29,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:29,960 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-03-04 16:40:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:30,599 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-03-04 16:40:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:30,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:30,604 INFO L225 Difference]: With dead ends: 368 [2019-03-04 16:40:30,604 INFO L226 Difference]: Without dead ends: 366 [2019-03-04 16:40:30,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-03-04 16:40:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-03-04 16:40:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-03-04 16:40:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-03-04 16:40:30,673 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-03-04 16:40:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:30,673 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-03-04 16:40:30,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-03-04 16:40:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:30,674 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:30,675 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:40:30,675 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-03-04 16:40:30,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:30,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:30,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:30,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:30,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:30,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:30,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:30,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:30,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:30,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:30,774 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:30,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:30,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:30,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:30,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:40:30,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:30,794 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:30,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,799 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:30,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,807 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:30,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,819 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:30,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:30,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,860 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:30,860 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,874 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,889 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,903 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,916 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,930 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:30,988 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,992 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,004 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,020 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,046 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,074 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,117 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,117 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:31,144 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:31,144 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,198 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:31,239 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:31,240 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,273 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,274 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:40:31,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:40:31,323 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,347 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,348 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:40:31,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 45 treesize of output 64 [2019-03-04 16:40:31,425 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,449 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-03-04 16:40:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:31,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:31,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:31,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:40:31,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:31,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:40:31,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:40:31,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:31,532 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-03-04 16:40:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:32,308 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-03-04 16:40:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:32,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:40:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:32,314 INFO L225 Difference]: With dead ends: 407 [2019-03-04 16:40:32,314 INFO L226 Difference]: Without dead ends: 401 [2019-03-04 16:40:32,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:40:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-03-04 16:40:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-03-04 16:40:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-03-04 16:40:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-03-04 16:40:32,392 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-03-04 16:40:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:32,392 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-03-04 16:40:32,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:40:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-03-04 16:40:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:32,393 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:32,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:32,394 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-03-04 16:40:32,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:32,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:32,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:32,705 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-03-04 16:40:33,179 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-03-04 16:40:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:33,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:33,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:33,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:33,324 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-03-04 16:40:33,325 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:33,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:33,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:33,328 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:33,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:33,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:33,329 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:33,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:33,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:33,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:40:33,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:33,360 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:33,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,411 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:33,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:33,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,471 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:33,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:33,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,512 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:33,512 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,526 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,539 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,553 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,567 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,581 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:33,637 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,646 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,660 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,678 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,698 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,726 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,771 INFO L309 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-03-04 16:40:33,771 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:33,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:33,811 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,854 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:33,854 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:33,897 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:33,898 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,930 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:33,930 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:40:33,984 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:40:33,984 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,008 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:34,008 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:40:34,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:40:34,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,104 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:34,104 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:53 [2019-03-04 16:40:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:34,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:40:34,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:34,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:34,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:34,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:34,198 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-03-04 16:40:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:36,895 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-03-04 16:40:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:40:36,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:40:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:36,903 INFO L225 Difference]: With dead ends: 645 [2019-03-04 16:40:36,903 INFO L226 Difference]: Without dead ends: 643 [2019-03-04 16:40:36,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:40:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-03-04 16:40:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-03-04 16:40:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-03-04 16:40:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-03-04 16:40:37,022 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-03-04 16:40:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:37,023 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-03-04 16:40:37,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-03-04 16:40:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:37,024 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:37,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:37,024 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-03-04 16:40:37,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:37,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:37,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:37,109 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-03-04 16:40:37,110 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:37,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:37,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:37,112 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:37,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,113 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:37,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:37,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:37,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:37,135 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:37,155 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:37,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,171 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:37,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,184 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:37,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,201 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:37,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:37,254 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,267 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,280 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,293 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,306 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,319 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,355 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:37,356 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,360 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,370 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,386 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,416 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:37,416 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:40:37,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:37,461 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,485 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:37,486 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:40:37,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:40:37,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:37,565 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:37,565 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-03-04 16:40:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:37,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-03-04 16:40:37,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:37,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:40:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:40:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:37,634 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-03-04 16:40:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:38,196 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-03-04 16:40:38,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:38,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:40:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:38,202 INFO L225 Difference]: With dead ends: 527 [2019-03-04 16:40:38,202 INFO L226 Difference]: Without dead ends: 524 [2019-03-04 16:40:38,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:40:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-03-04 16:40:38,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-03-04 16:40:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-03-04 16:40:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-03-04 16:40:38,313 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-03-04 16:40:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:38,313 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-03-04 16:40:38,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:40:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-03-04 16:40:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:38,314 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:38,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:38,314 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-03-04 16:40:38,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:38,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:38,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:38,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:38,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:38,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:38,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:38,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:38,392 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-03-04 16:40:38,393 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:38,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:38,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:38,396 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:38,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:38,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:38,397 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:38,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:38,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:38,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:38,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:38,418 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:38,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,425 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:38,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,436 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:38,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,453 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:38,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,469 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:38,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:38,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:38,526 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,539 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,552 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,565 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,579 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,592 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:38,639 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,645 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,653 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,666 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,684 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,716 INFO L309 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-03-04 16:40:38,717 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:40:38,768 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:38,769 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,797 INFO L309 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-03-04 16:40:38,798 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:40:38,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:38,836 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,856 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:38,857 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:40:38,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:40:38,908 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,925 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:38,925 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:40:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:38,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:39,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:39,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:39,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:39,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:39,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:39,015 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-03-04 16:40:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:39,623 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-03-04 16:40:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:39,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:39,630 INFO L225 Difference]: With dead ends: 534 [2019-03-04 16:40:39,630 INFO L226 Difference]: Without dead ends: 533 [2019-03-04 16:40:39,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-03-04 16:40:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-03-04 16:40:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-03-04 16:40:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-03-04 16:40:39,757 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-03-04 16:40:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:39,757 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-03-04 16:40:39,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-03-04 16:40:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:39,759 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:39,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:39,759 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-03-04 16:40:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:39,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:39,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:39,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:39,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:39,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:39,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:39,841 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-03-04 16:40:39,842 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:39,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:39,844 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:39,845 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:39,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:39,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:39,845 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:39,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:39,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:40:39,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:39,866 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:39,877 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:39,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,888 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:39,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,918 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:39,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,937 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:39,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:39,961 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,975 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,989 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,001 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,014 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,028 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:40,079 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,088 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,105 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,127 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,152 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,194 INFO L309 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-03-04 16:40:40,195 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:40:40,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:40,228 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,269 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:40,269 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:40:40,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:40:40,313 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,342 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:40,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-03-04 16:40:40,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:40:40,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,423 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:40,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:47 [2019-03-04 16:40:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:40,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:40,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:40,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:40,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:40,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:40,537 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-03-04 16:40:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:41,253 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-03-04 16:40:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:41,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:41,260 INFO L225 Difference]: With dead ends: 543 [2019-03-04 16:40:41,260 INFO L226 Difference]: Without dead ends: 542 [2019-03-04 16:40:41,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-03-04 16:40:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-03-04 16:40:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-03-04 16:40:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-03-04 16:40:41,382 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-03-04 16:40:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:41,383 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-03-04 16:40:41,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-03-04 16:40:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:41,384 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:41,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:41,385 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-03-04 16:40:41,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:41,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:41,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:41,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:41,548 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-03-04 16:40:41,548 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:41,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:41,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:41,551 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:41,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:41,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:41,552 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:41,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:41,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:41,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:40:41,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:41,574 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:41,594 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:41,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,603 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:41,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,615 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:41,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,633 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:41,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,664 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:41,664 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,676 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,689 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,700 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,713 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,726 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:41,776 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,781 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,790 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,804 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,830 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,871 INFO L309 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-03-04 16:40:41,871 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:40:41,906 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:41,907 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:41,947 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:40:41,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:40:41,987 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,014 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:42,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-03-04 16:40:42,068 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:40:42,069 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,091 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:42,092 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-03-04 16:40:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:42,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:42,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:42,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:42,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:42,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:42,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:42,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:42,174 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-03-04 16:40:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:42,857 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-03-04 16:40:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:42,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:42,861 INFO L225 Difference]: With dead ends: 537 [2019-03-04 16:40:42,861 INFO L226 Difference]: Without dead ends: 536 [2019-03-04 16:40:42,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-03-04 16:40:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-03-04 16:40:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-03-04 16:40:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-03-04 16:40:42,979 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-03-04 16:40:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:42,979 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-03-04 16:40:42,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-03-04 16:40:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:42,980 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:42,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:42,981 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-03-04 16:40:42,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:42,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:42,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:42,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:42,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:43,295 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-03-04 16:40:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:43,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:43,339 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:43,339 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-03-04 16:40:43,340 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:43,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:43,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:43,342 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:43,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:43,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,343 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:43,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:43,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:43,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:40:43,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:43,367 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:43,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,371 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:43,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,383 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:43,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:43,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:43,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,447 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:43,448 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,461 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,475 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,518 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,531 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,544 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:43,599 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,602 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,607 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,620 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,642 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,670 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,715 INFO L309 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-03-04 16:40:43,715 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:43,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:43,750 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:43,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:40:43,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:43,838 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,870 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:43,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:40:43,928 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 45 treesize of output 50 [2019-03-04 16:40:43,929 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,954 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:43,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-03-04 16:40:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:43,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:44,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:44,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:44,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:44,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:44,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:44,059 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-03-04 16:40:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:44,767 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-03-04 16:40:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:44,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:44,771 INFO L225 Difference]: With dead ends: 588 [2019-03-04 16:40:44,772 INFO L226 Difference]: Without dead ends: 587 [2019-03-04 16:40:44,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-03-04 16:40:44,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-03-04 16:40:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-03-04 16:40:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-03-04 16:40:44,898 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-03-04 16:40:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:44,898 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-03-04 16:40:44,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-03-04 16:40:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:44,899 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:44,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:44,899 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-03-04 16:40:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:44,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:44,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:44,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:44,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:44,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:44,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:44,965 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-03-04 16:40:44,966 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:44,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:44,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:44,969 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:44,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:44,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:44,970 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:44,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:44,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:44,983 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:40:44,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:45,016 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:45,206 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:45,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,236 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:45,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,248 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:45,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:45,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:45,290 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:45,291 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,304 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,317 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,331 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,344 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,358 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:45,408 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,416 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,430 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,517 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,544 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,586 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:45,587 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:40:45,614 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:45,614 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,653 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:45,654 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:40:45,695 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:40:45,696 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:45,729 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:45,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:59 [2019-03-04 16:40:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:45,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:45,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:45,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:45,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:45,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:45,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:45,825 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-03-04 16:40:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:46,377 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-03-04 16:40:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:46,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:40:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:46,381 INFO L225 Difference]: With dead ends: 558 [2019-03-04 16:40:46,382 INFO L226 Difference]: Without dead ends: 557 [2019-03-04 16:40:46,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-03-04 16:40:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-03-04 16:40:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-03-04 16:40:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-03-04 16:40:46,506 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-03-04 16:40:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:46,506 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-03-04 16:40:46,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-03-04 16:40:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:46,508 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:46,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:46,508 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-03-04 16:40:46,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:46,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:46,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:46,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:46,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:46,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:46,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:46,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:46,595 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-03-04 16:40:46,596 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:46,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:46,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:46,599 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:46,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:46,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:46,599 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:46,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:46,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:46,613 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:46,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:46,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:46,651 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,659 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,672 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,687 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,705 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:40:46,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:40:46,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:46,740 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:46,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:46,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:46,783 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,793 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,804 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,814 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,825 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,837 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,868 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:46,868 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:40:46,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:46,905 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:46,934 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:46,935 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:40:47,004 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:47,004 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,025 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:47,026 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-03-04 16:40:47,075 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:40:47,076 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,093 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:47,093 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:40:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:47,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:47,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:47,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:40:47,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:47,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:47,236 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-03-04 16:40:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:48,246 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-03-04 16:40:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:48,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:40:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:48,252 INFO L225 Difference]: With dead ends: 795 [2019-03-04 16:40:48,252 INFO L226 Difference]: Without dead ends: 794 [2019-03-04 16:40:48,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-03-04 16:40:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-03-04 16:40:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-03-04 16:40:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-03-04 16:40:48,418 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-03-04 16:40:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:48,419 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-03-04 16:40:48,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-03-04 16:40:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:48,420 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:48,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:48,421 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-03-04 16:40:48,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:48,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:48,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:48,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:48,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:48,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:48,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:48,563 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:40:48,563 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-03-04 16:40:48,564 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:48,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:48,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:48,567 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:48,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:48,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:48,567 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:48,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:48,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:48,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:48,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:48,586 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:48,600 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:40:48,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,608 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:48,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:48,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:48,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:48,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:48,689 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,699 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,712 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,724 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,737 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,750 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:40:48,788 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,803 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,812 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,827 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,857 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:48,857 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:40:48,903 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:48,903 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,928 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:48,929 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:40:48,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:40:48,976 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:49,015 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:49,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:88 [2019-03-04 16:40:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:49,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:49,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:49,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-03-04 16:40:49,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:49,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:40:49,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:40:49,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:49,100 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-03-04 16:40:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:49,803 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-03-04 16:40:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:49,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:40:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:49,806 INFO L225 Difference]: With dead ends: 539 [2019-03-04 16:40:49,806 INFO L226 Difference]: Without dead ends: 538 [2019-03-04 16:40:49,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:40:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-03-04 16:40:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-03-04 16:40:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-03-04 16:40:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-03-04 16:40:49,958 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-03-04 16:40:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:49,958 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-03-04 16:40:49,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:40:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-03-04 16:40:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:49,959 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:49,959 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:40:49,960 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-03-04 16:40:49,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:49,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:49,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:49,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:49,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:50,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:50,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:50,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:50,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:50,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:50,052 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:50,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:50,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:50,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:40:50,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:50,073 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:50,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,077 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:50,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:50,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:50,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,114 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:50,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:40:50,166 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,177 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,190 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,202 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,215 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,228 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:40:50,273 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,278 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,287 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,298 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,317 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,349 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:50,350 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:40:50,581 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-03-04 16:40:50,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:50,597 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:50,646 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-03-04 16:40:50,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-03-04 16:40:50,897 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-03-04 16:40:50,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 61 [2019-03-04 16:40:50,924 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,064 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 65 treesize of output 74 [2019-03-04 16:40:51,065 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:40:51,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:40:51,199 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:132 [2019-03-04 16:40:51,436 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-03-04 16:40:51,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 68 [2019-03-04 16:40:51,492 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,635 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 55 treesize of output 81 [2019-03-04 16:40:51,636 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 65 [2019-03-04 16:40:51,760 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,820 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-03-04 16:40:51,820 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:129 [2019-03-04 16:40:52,056 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-03-04 16:40:52,129 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 55 treesize of output 85 [2019-03-04 16:40:52,132 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:40:52,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:40:52,372 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:52,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:40:52,573 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:52,694 INFO L309 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-03-04 16:40:52,694 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-03-04 16:40:52,994 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 83 [2019-03-04 16:40:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:52,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:53,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:53,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:40:53,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:53,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:40:53,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:40:53,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:53,095 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-03-04 16:40:53,335 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-03-04 16:40:54,007 WARN L181 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-03-04 16:40:54,499 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-03-04 16:40:55,019 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-03-04 16:40:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:55,834 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-03-04 16:40:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:55,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:40:55,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:55,839 INFO L225 Difference]: With dead ends: 678 [2019-03-04 16:40:55,839 INFO L226 Difference]: Without dead ends: 673 [2019-03-04 16:40:55,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:40:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-03-04 16:40:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-03-04 16:40:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-03-04 16:40:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-03-04 16:40:56,121 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-03-04 16:40:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:56,122 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-03-04 16:40:56,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:40:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-03-04 16:40:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:56,123 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:56,123 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:40:56,123 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-03-04 16:40:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:56,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:56,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:56,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:56,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:56,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:56,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:56,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:56,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:56,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:56,557 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:56,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:56,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:56,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:56,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:56,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:40:56,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:56,584 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:56,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,589 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:56,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:56,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,610 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:56,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,627 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:56,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:56,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:56,651 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,665 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,679 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,693 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,707 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,719 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:56,776 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,784 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,794 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,808 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,832 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,861 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,906 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:56,906 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:56,938 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:56,939 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:56,982 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:56,983 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:57,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:57,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,053 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:57,054 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:40:57,132 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 43 treesize of output 69 [2019-03-04 16:40:57,133 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,165 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:57,166 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:57 [2019-03-04 16:40:57,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:40:57,217 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:57,242 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:57,243 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-03-04 16:40:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:57,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:57,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:57,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:40:57,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:57,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:40:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:40:57,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:57,335 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-03-04 16:40:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:58,188 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-03-04 16:40:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:58,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:40:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:58,195 INFO L225 Difference]: With dead ends: 704 [2019-03-04 16:40:58,195 INFO L226 Difference]: Without dead ends: 703 [2019-03-04 16:40:58,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:40:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-03-04 16:40:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-03-04 16:40:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-03-04 16:40:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-03-04 16:40:58,486 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-03-04 16:40:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:58,486 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-03-04 16:40:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:40:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-03-04 16:40:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:40:58,487 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:58,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:40:58,488 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:58,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-03-04 16:40:58,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:58,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:58,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:58,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:58,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:58,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:58,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:58,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:58,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:58,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:58,686 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:58,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:58,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:58,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:58,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:58,703 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:40:58,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:58,707 INFO L453 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 21 treesize of output 24 [2019-03-04 16:40:58,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,713 INFO L453 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 24 treesize of output 26 [2019-03-04 16:40:58,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,721 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:40:58,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:40:58,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,749 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:58,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:40:58,773 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,785 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,799 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,813 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,827 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,839 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,896 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:58,896 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,902 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,913 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,926 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,948 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,976 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:59,021 INFO L309 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-03-04 16:40:59,022 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:40:59,057 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:40:59,057 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:59,101 INFO L309 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-03-04 16:40:59,101 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:40:59,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:40:59,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:59,178 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:59,178 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:40:59,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:40:59,233 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:59,258 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:59,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:40:59,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:40:59,333 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:59,357 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:59,357 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:53 [2019-03-04 16:40:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:59,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:59,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:59,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:40:59,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:59,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:59,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:59,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:59,451 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-03-04 16:41:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:01,192 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-03-04 16:41:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:41:01,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:41:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:01,200 INFO L225 Difference]: With dead ends: 1218 [2019-03-04 16:41:01,200 INFO L226 Difference]: Without dead ends: 1217 [2019-03-04 16:41:01,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:41:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-03-04 16:41:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-03-04 16:41:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-03-04 16:41:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-03-04 16:41:01,560 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-03-04 16:41:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:01,560 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-03-04 16:41:01,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-03-04 16:41:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:01,562 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:01,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:01,562 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-03-04 16:41:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:01,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:01,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:01,700 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:41:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:01,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:01,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:01,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:01,740 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-03-04 16:41:01,741 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:01,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:01,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:01,743 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:01,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:01,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:01,744 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:01,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:01,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:01,758 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:41:01,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:01,764 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:01,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,769 INFO L453 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 24 treesize of output 26 [2019-03-04 16:41:01,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,779 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:01,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:01,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:01,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:41:01,836 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,849 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,863 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,877 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,891 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,905 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:02,071 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,079 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,090 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,107 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,171 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,200 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,245 INFO L309 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-03-04 16:41:02,245 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:41:02,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:02,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,324 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:02,325 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:02,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:02,371 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,405 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:02,405 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-03-04 16:41:02,465 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 41 treesize of output 46 [2019-03-04 16:41:02,466 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,491 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:02,492 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:49 [2019-03-04 16:41:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:02,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:02,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:02,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:02,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:02,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:02,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:02,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:02,583 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-03-04 16:41:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:03,437 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-03-04 16:41:03,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:03,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:41:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:03,441 INFO L225 Difference]: With dead ends: 814 [2019-03-04 16:41:03,441 INFO L226 Difference]: Without dead ends: 811 [2019-03-04 16:41:03,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-03-04 16:41:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-03-04 16:41:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-03-04 16:41:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-03-04 16:41:03,754 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-03-04 16:41:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:03,754 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-03-04 16:41:03,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-03-04 16:41:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:03,756 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:03,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:03,756 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-03-04 16:41:03,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:03,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:03,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:03,984 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-03-04 16:41:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:04,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:04,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:04,000 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:04,000 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-03-04 16:41:04,001 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:04,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:04,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:04,005 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:04,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:04,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:04,005 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:04,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:04,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:04,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:04,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:04,044 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:04,044 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,052 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,065 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,082 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,101 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,125 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:41:04,129 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:41:04,132 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:04,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:04,139 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:04,176 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:04,177 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,188 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,200 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,210 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,222 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,234 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,266 INFO L309 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-03-04 16:41:04,267 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:41:04,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:04,322 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,350 INFO L309 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-03-04 16:41:04,350 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:41:04,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:04,392 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,412 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:04,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:41:04,467 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:41:04,468 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,488 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:04,488 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:41:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:04,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:04,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:04,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:41:04,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:04,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:41:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:41:04,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:04,568 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-03-04 16:41:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:05,420 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-03-04 16:41:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:05,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:41:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:05,423 INFO L225 Difference]: With dead ends: 812 [2019-03-04 16:41:05,423 INFO L226 Difference]: Without dead ends: 811 [2019-03-04 16:41:05,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-03-04 16:41:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-03-04 16:41:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-03-04 16:41:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-03-04 16:41:05,736 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-03-04 16:41:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:05,736 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-03-04 16:41:05,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:41:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-03-04 16:41:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:05,738 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:05,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:05,738 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:05,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:05,738 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-03-04 16:41:05,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:05,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:05,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:05,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:05,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:05,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:05,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:05,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:05,824 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-03-04 16:41:05,825 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:05,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:05,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:05,828 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:05,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:05,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:05,829 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:05,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:05,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:05,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:05,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:05,885 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:06,066 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:41:06,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,177 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:06,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,307 INFO L301 Elim1Store]: Index analysis took 104 ms [2019-03-04 16:41:06,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:06,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,327 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:06,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:06,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:41:06,377 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,396 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,409 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,423 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,436 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,450 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:06,531 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,543 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,554 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,571 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,597 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,640 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:06,640 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:41:06,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:06,677 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:06,743 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:06,743 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-03-04 16:41:06,789 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:06,790 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:06,816 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:06,816 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:40 [2019-03-04 16:41:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:06,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:06,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:41:06,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:06,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:06,874 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-03-04 16:41:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:07,547 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-03-04 16:41:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:07,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:41:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:07,550 INFO L225 Difference]: With dead ends: 843 [2019-03-04 16:41:07,550 INFO L226 Difference]: Without dead ends: 842 [2019-03-04 16:41:07,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:41:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-03-04 16:41:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-03-04 16:41:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-03-04 16:41:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-03-04 16:41:07,865 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-03-04 16:41:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:07,865 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-03-04 16:41:07,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-03-04 16:41:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:07,866 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:07,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:07,867 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-03-04 16:41:07,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:07,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:07,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:07,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:07,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:07,928 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-03-04 16:41:07,928 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:07,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:07,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:07,932 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:07,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:07,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:07,932 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:07,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:07,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:07,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:07,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:07,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:07,989 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,999 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,013 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,027 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,050 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:41:08,085 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:41:08,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:08,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:08,095 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:08,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:08,159 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,170 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,182 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,193 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,205 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,217 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,249 INFO L309 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-03-04 16:41:08,250 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:41:08,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:08,353 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:08,402 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:08,402 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-03-04 16:41:08,553 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 65 treesize of output 91 [2019-03-04 16:41:08,557 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:41:08,827 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 83 [2019-03-04 16:41:08,828 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:08,996 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-03-04 16:41:08,996 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:284 [2019-03-04 16:41:09,835 WARN L181 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-03-04 16:41:09,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2019-03-04 16:41:09,847 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:41:09,993 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:41:10,119 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,257 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:41:10,258 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,338 INFO L309 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-03-04 16:41:10,339 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-03-04 16:41:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:10,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:10,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:10,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:10,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:10,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:10,531 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-03-04 16:41:10,713 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-03-04 16:41:10,934 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-03-04 16:41:11,321 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-03-04 16:41:12,109 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-03-04 16:41:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:12,412 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-03-04 16:41:12,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:12,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:41:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:12,417 INFO L225 Difference]: With dead ends: 896 [2019-03-04 16:41:12,417 INFO L226 Difference]: Without dead ends: 895 [2019-03-04 16:41:12,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:41:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-03-04 16:41:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-03-04 16:41:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-03-04 16:41:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-03-04 16:41:12,763 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-03-04 16:41:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:12,763 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-03-04 16:41:12,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-03-04 16:41:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:12,765 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:12,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:12,765 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-03-04 16:41:12,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:12,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:12,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:12,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:12,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:12,838 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:12,839 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-03-04 16:41:12,845 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:12,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:12,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:12,847 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:12,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:12,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:12,848 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:12,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:12,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:12,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:12,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:12,952 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:12,953 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,960 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,970 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,985 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,003 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:41:13,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:41:13,034 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:13,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:13,041 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:13,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:13,080 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,089 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,101 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,111 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,123 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,134 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,167 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:13,167 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:41:13,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:13,208 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,236 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:13,237 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:41:13,272 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:41:13,272 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,291 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:13,291 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:41:13,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:41:13,338 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:13,355 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:13,355 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:41:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:13,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:13,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:13,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:13,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:13,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:13,425 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-03-04 16:41:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:14,382 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-03-04 16:41:14,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:14,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:41:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:14,387 INFO L225 Difference]: With dead ends: 975 [2019-03-04 16:41:14,387 INFO L226 Difference]: Without dead ends: 973 [2019-03-04 16:41:14,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-03-04 16:41:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-03-04 16:41:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-03-04 16:41:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-03-04 16:41:14,790 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-03-04 16:41:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:14,790 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-03-04 16:41:14,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-03-04 16:41:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:14,792 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:14,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:14,792 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-03-04 16:41:14,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:14,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:14,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:15,007 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:41:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:15,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:15,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:15,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:15,060 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-03-04 16:41:15,061 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:15,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:15,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:15,064 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:15,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:15,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:15,065 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:15,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:15,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:15,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:41:15,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:15,088 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:15,110 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:41:15,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,125 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:15,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,138 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:15,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:15,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:15,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:15,217 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,230 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,243 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,256 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,269 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,282 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:41:15,321 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,326 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,335 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,351 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,381 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:15,381 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:41:15,454 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:15,455 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:15,499 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:15,499 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:41:15,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 58 [2019-03-04 16:41:15,575 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:41:15,655 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,693 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:15,694 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-03-04 16:41:17,613 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 55 [2019-03-04 16:41:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:17,619 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:17,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:17,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:41:17,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:17,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:17,673 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-03-04 16:41:20,311 WARN L181 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-03-04 16:41:20,627 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-03-04 16:41:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:21,411 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-03-04 16:41:21,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:21,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:41:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:21,415 INFO L225 Difference]: With dead ends: 985 [2019-03-04 16:41:21,415 INFO L226 Difference]: Without dead ends: 984 [2019-03-04 16:41:21,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-03-04 16:41:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-03-04 16:41:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-03-04 16:41:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-03-04 16:41:21,811 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-03-04 16:41:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:21,811 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-03-04 16:41:21,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-03-04 16:41:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:21,813 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:21,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:21,813 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-03-04 16:41:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:21,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:21,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:21,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:21,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:21,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:21,922 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-03-04 16:41:21,922 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:21,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:21,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:21,924 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:21,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:21,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:21,925 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:21,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:21,939 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:21,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:21,983 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:21,983 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,986 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,992 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,007 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,028 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,057 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,095 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:41:22,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:41:22,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:22,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:22,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:22,114 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:41:22,114 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,126 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,139 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,151 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,163 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,174 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,219 INFO L309 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-03-04 16:41:22,220 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:41:22,265 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:22,265 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,307 INFO L309 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-03-04 16:41:22,308 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:22,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:41:22,358 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,387 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,388 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:22,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:41:22,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,475 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,475 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:22,586 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:41:22,587 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,611 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,611 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:53 [2019-03-04 16:41:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:22,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:23,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:23,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:23,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:23,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:23,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:23,309 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-03-04 16:41:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:29,394 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-03-04 16:41:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:29,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:41:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:29,399 INFO L225 Difference]: With dead ends: 1024 [2019-03-04 16:41:29,399 INFO L226 Difference]: Without dead ends: 1023 [2019-03-04 16:41:29,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:41:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-03-04 16:41:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-03-04 16:41:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-03-04 16:41:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-03-04 16:41:29,802 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-03-04 16:41:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:29,802 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-03-04 16:41:29,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-03-04 16:41:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:29,804 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:29,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:29,804 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:29,804 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-03-04 16:41:29,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:29,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:29,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:29,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:29,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:29,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:29,996 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-03-04 16:41:29,997 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:29,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:29,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:29,999 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:30,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:30,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:30,000 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:30,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:30,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:30,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:30,023 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:30,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,032 INFO L453 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 24 treesize of output 26 [2019-03-04 16:41:30,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,046 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:30,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,056 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:30,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:30,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:30,097 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:41:30,097 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,112 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,126 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,140 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,154 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,168 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,222 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:30,222 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,225 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,234 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,252 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,274 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,302 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,348 INFO L309 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-03-04 16:41:30,348 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:41:30,392 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:30,393 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,435 INFO L309 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-03-04 16:41:30,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:30,487 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:30,488 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,520 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,520 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:30,578 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:41:30,579 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,603 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:41:30,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:41:30,797 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,820 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-03-04 16:41:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:30,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:41:30,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:30,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:30,920 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-03-04 16:41:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:32,483 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-03-04 16:41:32,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:32,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:41:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:32,488 INFO L225 Difference]: With dead ends: 1059 [2019-03-04 16:41:32,488 INFO L226 Difference]: Without dead ends: 1057 [2019-03-04 16:41:32,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:41:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-03-04 16:41:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-03-04 16:41:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-03-04 16:41:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-03-04 16:41:32,867 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-03-04 16:41:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:32,867 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-03-04 16:41:32,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-03-04 16:41:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:32,869 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:32,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:32,869 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-03-04 16:41:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:32,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:32,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:32,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:32,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:32,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:32,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:32,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:32,946 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-03-04 16:41:32,947 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:32,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:32,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:32,950 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:32,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:32,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:32,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:32,951 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:32,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:32,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:32,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:32,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:32,976 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:32,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:32,982 INFO L453 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 24 treesize of output 26 [2019-03-04 16:41:32,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:32,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:32,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:32,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:32,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:32,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:32,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:33,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,047 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:33,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:33,099 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,111 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,125 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,138 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,151 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,164 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:33,210 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,215 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,226 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,242 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,271 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,304 INFO L309 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-03-04 16:41:33,304 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-03-04 16:41:33,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:33,372 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,399 INFO L309 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-03-04 16:41:33,399 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-03-04 16:41:33,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:41:33,441 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,460 INFO L309 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-03-04 16:41:33,460 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:40 [2019-03-04 16:41:33,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:41:33,516 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,532 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:33,532 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 16:41:33,595 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:41:33,595 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,610 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:33,610 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:33,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:33,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:33,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:33,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:33,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:33,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:33,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:33,712 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-03-04 16:41:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:35,928 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-03-04 16:41:35,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:35,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:41:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:35,933 INFO L225 Difference]: With dead ends: 1044 [2019-03-04 16:41:35,933 INFO L226 Difference]: Without dead ends: 1042 [2019-03-04 16:41:35,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:41:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-03-04 16:41:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-03-04 16:41:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-03-04 16:41:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-03-04 16:41:36,334 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-03-04 16:41:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:36,335 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-03-04 16:41:36,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-03-04 16:41:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:36,336 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:36,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:36,336 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-03-04 16:41:36,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:36,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:36,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:36,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:36,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,479 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:36,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:36,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:41:36,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:36,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:41:36,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:36,533 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:41:36,534 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,536 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,548 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,563 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,584 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,614 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:41:36,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:41:36,659 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:36,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:36,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:36,703 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:41:36,704 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,847 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,860 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,872 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,884 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,896 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,946 INFO L309 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-03-04 16:41:36,946 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:41:36,999 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:36,999 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,053 INFO L309 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-03-04 16:41:37,053 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:41:37,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:37,130 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,187 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:37,187 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:41:37,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:41:37,263 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,299 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:37,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-03-04 16:41:37,405 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:41:37,406 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,430 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:37,430 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:47 [2019-03-04 16:41:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:37,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:37,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:37,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:37,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:37,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:37,535 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-03-04 16:41:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:38,823 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-03-04 16:41:38,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:38,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:41:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:38,828 INFO L225 Difference]: With dead ends: 1044 [2019-03-04 16:41:38,829 INFO L226 Difference]: Without dead ends: 1041 [2019-03-04 16:41:38,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:41:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-03-04 16:41:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-03-04 16:41:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-03-04 16:41:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-03-04 16:41:39,226 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-03-04 16:41:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:39,226 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-03-04 16:41:39,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-03-04 16:41:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:39,228 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:39,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:39,228 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-03-04 16:41:39,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:39,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:39,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:39,332 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-03-04 16:41:39,333 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:39,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:39,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:39,336 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:39,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,337 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:39,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:39,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,352 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:39,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:39,356 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:39,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,361 INFO L453 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 24 treesize of output 26 [2019-03-04 16:41:39,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:39,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,384 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:39,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:39,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,474 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:39,475 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,488 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,500 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,513 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,526 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,538 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:39,585 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,587 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,595 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,606 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,623 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,656 INFO L309 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-03-04 16:41:39,657 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:41:39,761 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:39,762 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:39,814 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:39,814 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-03-04 16:41:39,931 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-03-04 16:41:39,968 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 65 treesize of output 74 [2019-03-04 16:41:39,969 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:40,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2019-03-04 16:41:40,106 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,188 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-03-04 16:41:40,188 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-03-04 16:41:40,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 57 treesize of output 69 [2019-03-04 16:41:40,358 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:40,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 56 [2019-03-04 16:41:40,515 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,644 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 57 [2019-03-04 16:41:40,645 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,728 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-03-04 16:41:40,728 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:153 [2019-03-04 16:41:40,857 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-03-04 16:41:40,917 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 46 treesize of output 61 [2019-03-04 16:41:40,918 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,084 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 51 treesize of output 77 [2019-03-04 16:41:41,086 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-03-04 16:41:41,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 16:41:41,305 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 16:41:41,488 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,612 INFO L309 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-03-04 16:41:41,612 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:240 [2019-03-04 16:41:41,813 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-03-04 16:41:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:41,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:41,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:41,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:41,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:41,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:41,933 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-03-04 16:41:42,132 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-03-04 16:41:42,431 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-03-04 16:41:42,861 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-03-04 16:41:43,313 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-03-04 16:41:43,797 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 87 [2019-03-04 16:41:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:44,662 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-03-04 16:41:44,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:44,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:41:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:44,666 INFO L225 Difference]: With dead ends: 1104 [2019-03-04 16:41:44,667 INFO L226 Difference]: Without dead ends: 1102 [2019-03-04 16:41:44,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:41:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-03-04 16:41:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-03-04 16:41:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-03-04 16:41:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-03-04 16:41:45,073 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-03-04 16:41:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:45,073 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-03-04 16:41:45,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-03-04 16:41:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:45,074 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:45,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:45,075 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-03-04 16:41:45,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:45,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:45,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:45,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:45,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:45,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:45,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:45,175 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-03-04 16:41:45,176 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:45,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:45,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:45,178 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:45,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:45,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:45,179 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:45,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:45,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:45,193 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:41:45,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:45,224 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:45,225 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,237 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,253 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,273 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,300 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:41:45,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:41:45,350 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:45,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:45,406 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:45,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:45,504 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,516 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,527 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,538 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,548 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,560 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,591 INFO L309 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-03-04 16:41:45,591 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:41:45,645 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:45,646 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,671 INFO L309 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-03-04 16:41:45,671 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:41:45,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:45,712 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,733 INFO L309 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-03-04 16:41:45,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-03-04 16:41:45,807 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:41:45,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,825 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:45,825 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2019-03-04 16:41:45,883 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:41:45,884 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:45,898 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:45,898 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:38 [2019-03-04 16:41:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:45,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:45,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:45,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:41:45,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:45,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:45,985 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-03-04 16:41:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:48,435 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-03-04 16:41:48,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:41:48,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:41:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:48,440 INFO L225 Difference]: With dead ends: 1313 [2019-03-04 16:41:48,440 INFO L226 Difference]: Without dead ends: 1312 [2019-03-04 16:41:48,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:41:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-03-04 16:41:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-03-04 16:41:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-03-04 16:41:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-03-04 16:41:48,868 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-03-04 16:41:48,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:48,868 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-03-04 16:41:48,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-03-04 16:41:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:48,870 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:48,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:48,870 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-03-04 16:41:48,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:48,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:48,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:48,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:48,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:48,929 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-03-04 16:41:48,929 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:48,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:48,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:48,931 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:48,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:48,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:48,932 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:48,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:48,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:48,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:41:48,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:48,958 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:48,975 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:41:48,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:48,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:48,985 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:48,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:48,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:48,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:48,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:48,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:49,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:49,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:41:49,041 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,054 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,067 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,081 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,095 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,108 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:41:49,160 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,170 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,183 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,202 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,228 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,270 INFO L309 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-03-04 16:41:49,271 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:41:49,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:41:49,309 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,347 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:49,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-03-04 16:41:49,390 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:41:49,391 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,421 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:49,422 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:53 [2019-03-04 16:41:49,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:41:49,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,550 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:49,551 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-03-04 16:41:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:49,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:49,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:49,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:49,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:49,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:49,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:49,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:49,633 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-03-04 16:41:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:50,559 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-03-04 16:41:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:50,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:41:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:50,563 INFO L225 Difference]: With dead ends: 881 [2019-03-04 16:41:50,563 INFO L226 Difference]: Without dead ends: 880 [2019-03-04 16:41:50,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-03-04 16:41:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-03-04 16:41:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-03-04 16:41:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-03-04 16:41:50,981 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-03-04 16:41:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:50,981 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-03-04 16:41:50,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-03-04 16:41:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:50,982 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:50,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:50,983 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-03-04 16:41:50,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:50,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:50,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:50,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:50,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:51,152 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-03-04 16:41:51,380 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-03-04 16:41:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:51,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:51,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:51,422 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-03-04 16:41:51,423 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:51,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:51,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:51,425 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:51,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:51,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:51,426 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:51,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:51,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:41:51,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:51,454 INFO L453 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 21 treesize of output 24 [2019-03-04 16:41:51,476 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:41:51,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,483 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:51,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:51,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,513 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:51,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:51,565 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:51,566 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,579 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,593 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,606 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,620 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,634 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:41:51,675 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,682 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,695 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,711 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,741 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:51,742 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:41:51,786 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:51,787 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,813 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:51,814 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:41:51,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:41:51,857 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:51,895 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:51,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:41:51,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:41:51,955 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:51,966 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:51,966 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-03-04 16:41:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:51,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:52,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:52,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:41:52,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:52,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:52,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:52,028 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-03-04 16:41:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:53,258 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-03-04 16:41:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:53,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:41:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:53,263 INFO L225 Difference]: With dead ends: 1415 [2019-03-04 16:41:53,263 INFO L226 Difference]: Without dead ends: 1413 [2019-03-04 16:41:53,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-03-04 16:41:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-03-04 16:41:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-03-04 16:41:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-03-04 16:41:53,929 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-03-04 16:41:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:53,929 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-03-04 16:41:53,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-03-04 16:41:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:41:53,932 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:53,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:41:53,933 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-03-04 16:41:53,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:53,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:53,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:53,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:53,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:54,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:54,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:54,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:41:54,014 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-03-04 16:41:54,014 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:54,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:54,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:54,016 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:54,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:54,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:54,017 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:54,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:54,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:54,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:41:54,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:54,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:41:54,062 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,068 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,079 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,096 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:41:54,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:41:54,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:41:54,141 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:41:54,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:54,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:41:54,187 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,198 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,209 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,221 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,232 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,242 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:54,272 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:54,273 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:41:54,467 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-03-04 16:41:54,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 41 treesize of output 71 [2019-03-04 16:41:54,521 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:41:54,752 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-03-04 16:41:54,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:437 [2019-03-04 16:41:54,905 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 92 [2019-03-04 16:41:54,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 51 [2019-03-04 16:41:54,957 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,089 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 67 [2019-03-04 16:41:55,090 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:55,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 67 [2019-03-04 16:41:55,242 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:55,383 INFO L309 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-03-04 16:41:55,383 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:198, output treesize:198 [2019-03-04 16:41:55,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:41:55,515 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 44 [2019-03-04 16:41:55,593 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:41:55,662 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,698 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:41:55,699 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:136, output treesize:92 [2019-03-04 16:41:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:55,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:55,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:55,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:55,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:55,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:55,843 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-03-04 16:41:56,240 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-03-04 16:42:04,596 WARN L181 SmtUtils]: Spent 7.85 s on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-03-04 16:42:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:05,451 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-03-04 16:42:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:42:05,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:42:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:05,457 INFO L225 Difference]: With dead ends: 1381 [2019-03-04 16:42:05,457 INFO L226 Difference]: Without dead ends: 1379 [2019-03-04 16:42:05,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:42:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-03-04 16:42:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-03-04 16:42:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-03-04 16:42:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-03-04 16:42:06,148 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-03-04 16:42:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:06,148 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-03-04 16:42:06,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:42:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-03-04 16:42:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:42:06,150 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:06,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:42:06,151 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-03-04 16:42:06,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:06,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:06,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:06,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:06,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:42:06,202 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-03-04 16:42:06,203 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:06,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:06,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:06,205 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:06,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:06,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:06,206 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:06,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:06,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:06,218 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:42:06,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:06,259 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:42:06,259 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,269 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,286 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,307 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,335 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,370 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:42:06,383 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:42:06,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:06,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:06,401 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:06,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:42:06,407 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,419 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,431 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,443 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,455 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,467 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,510 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:06,511 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:42:06,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:42:06,538 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,578 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:06,579 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:42:06,625 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:42:06,626 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:42:06,680 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-03-04 16:42:06,680 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:122 [2019-03-04 16:42:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:06,723 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:42:06,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:06,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:42:06,764 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-03-04 16:42:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:07,895 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-03-04 16:42:07,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:42:07,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:42:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:07,900 INFO L225 Difference]: With dead ends: 1306 [2019-03-04 16:42:07,900 INFO L226 Difference]: Without dead ends: 1305 [2019-03-04 16:42:07,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-03-04 16:42:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-03-04 16:42:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-03-04 16:42:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-03-04 16:42:08,554 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-03-04 16:42:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:08,554 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-03-04 16:42:08,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-03-04 16:42:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:42:08,556 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:08,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:42:08,557 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-03-04 16:42:08,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:08,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:08,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:08,697 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-03-04 16:42:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:08,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:08,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:08,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:42:08,751 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-03-04 16:42:08,752 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:08,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:08,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:08,755 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:08,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:08,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:08,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:08,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:08,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:08,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:42:08,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:08,813 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:08,813 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,818 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,828 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,848 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,868 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,897 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:42:08,937 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:42:08,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:08,944 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:08,948 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:08,953 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:42:08,953 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,965 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,977 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:08,989 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,001 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,041 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,086 INFO L309 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-03-04 16:42:09,086 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:42:09,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:42:09,130 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,172 INFO L309 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-03-04 16:42:09,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:42:09,450 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:42:09,451 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,626 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:09,626 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:63 [2019-03-04 16:42:09,687 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 45 treesize of output 46 [2019-03-04 16:42:09,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,710 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:09,711 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-03-04 16:42:09,785 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 57 [2019-03-04 16:42:09,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:09,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:53 [2019-03-04 16:42:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:09,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:09,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:09,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:42:09,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:09,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:42:09,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:42:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:42:09,919 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-03-04 16:42:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:11,479 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-03-04 16:42:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:11,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:42:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:11,484 INFO L225 Difference]: With dead ends: 1360 [2019-03-04 16:42:11,485 INFO L226 Difference]: Without dead ends: 1358 [2019-03-04 16:42:11,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:42:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-03-04 16:42:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-03-04 16:42:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-03-04 16:42:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-03-04 16:42:12,202 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-03-04 16:42:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:12,202 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-03-04 16:42:12,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:42:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-03-04 16:42:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:42:12,204 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:12,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:42:12,205 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-03-04 16:42:12,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:12,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:12,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:12,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:12,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:12,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:12,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:12,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:12,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:12,275 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:12,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:12,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:12,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:42:12,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:12,291 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:42:12,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:12,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:12,343 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,353 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,365 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,385 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,408 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,438 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:42:12,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:42:12,482 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:12,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:12,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:12,494 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:42:12,495 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,507 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,519 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,530 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,542 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,555 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,601 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:12,601 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:42:12,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:42:12,628 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,672 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:12,672 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:42:12,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:42:12,710 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:12,745 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:42:12,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:42:12,820 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,863 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:12,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-03-04 16:42:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:12,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:12,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:12,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:42:12,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:12,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:12,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:12,936 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-03-04 16:42:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:14,741 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-03-04 16:42:14,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:14,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:42:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:14,747 INFO L225 Difference]: With dead ends: 1898 [2019-03-04 16:42:14,747 INFO L226 Difference]: Without dead ends: 1896 [2019-03-04 16:42:14,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:42:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-03-04 16:42:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-03-04 16:42:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-03-04 16:42:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-03-04 16:42:15,764 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-03-04 16:42:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:15,764 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-03-04 16:42:15,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:42:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-03-04 16:42:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:42:15,769 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:15,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:42:15,769 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-03-04 16:42:15,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:15,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:15,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:15,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:42:15,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:42:15,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:42:15,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:42:15,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:42:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:42:15,866 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-03-04 16:42:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:16,923 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-03-04 16:42:16,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:42:16,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-03-04 16:42:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:16,930 INFO L225 Difference]: With dead ends: 1693 [2019-03-04 16:42:16,930 INFO L226 Difference]: Without dead ends: 1692 [2019-03-04 16:42:16,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:42:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-03-04 16:42:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-03-04 16:42:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-03-04 16:42:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-03-04 16:42:17,953 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-03-04 16:42:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:17,953 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-03-04 16:42:17,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:42:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-03-04 16:42:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:42:17,957 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:17,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:42:17,957 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-03-04 16:42:17,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:17,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:17,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:17,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:17,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:17,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:17,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:17,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:42:17,996 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-03-04 16:42:17,997 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:17,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:17,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:17,999 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:17,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:18,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:18,000 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:18,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:18,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:18,014 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:42:18,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:18,019 INFO L453 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 21 treesize of output 24 [2019-03-04 16:42:18,043 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:42:18,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,055 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:18,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,076 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:18,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,111 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:18,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:18,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:42:18,148 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,163 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,183 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,199 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,217 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,236 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:42:18,291 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,297 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,309 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,330 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,357 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,400 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:18,401 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-03-04 16:42:18,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:42:18,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,467 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:18,468 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-03-04 16:42:18,502 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:42:18,503 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,531 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:18,532 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:53 [2019-03-04 16:42:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:18,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:42:18,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:42:18,583 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-03-04 16:42:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:20,656 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-03-04 16:42:20,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:20,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:42:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:20,665 INFO L225 Difference]: With dead ends: 2759 [2019-03-04 16:42:20,665 INFO L226 Difference]: Without dead ends: 2757 [2019-03-04 16:42:20,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:42:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-03-04 16:42:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-03-04 16:42:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-03-04 16:42:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-03-04 16:42:22,347 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-03-04 16:42:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:22,348 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-03-04 16:42:22,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-03-04 16:42:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:42:22,353 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:22,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:42:22,353 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-03-04 16:42:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:22,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:22,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:22,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:22,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:22,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:42:22,474 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-03-04 16:42:22,476 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:22,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:22,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:22,478 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:22,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:22,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:22,479 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:22,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:22,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:22,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:42:22,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:22,542 INFO L453 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 21 treesize of output 24 [2019-03-04 16:42:22,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,552 INFO L453 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 24 treesize of output 26 [2019-03-04 16:42:22,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,560 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:22,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:22,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:22,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:22,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:42:22,617 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,631 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,645 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,659 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,673 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,687 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,745 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:22,746 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,752 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,769 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,791 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,815 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,842 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,887 INFO L309 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-03-04 16:42:22,888 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:42:22,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:42:22,927 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,971 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:22,971 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:42:23,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:42:23,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:23,432 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:23,432 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-03-04 16:42:23,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 41 treesize of output 42 [2019-03-04 16:42:23,489 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:23,511 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:23,512 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:49 [2019-03-04 16:42:23,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:42:23,586 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:23,609 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:23,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:47 [2019-03-04 16:42:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:23,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:23,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:23,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:42:23,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:23,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:42:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:42:23,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:23,699 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-03-04 16:42:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:27,136 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-03-04 16:42:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:42:27,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:42:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:27,149 INFO L225 Difference]: With dead ends: 3636 [2019-03-04 16:42:27,149 INFO L226 Difference]: Without dead ends: 3626 [2019-03-04 16:42:27,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:42:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-03-04 16:42:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-03-04 16:42:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-03-04 16:42:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-03-04 16:42:29,613 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-03-04 16:42:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:29,613 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-03-04 16:42:29,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:42:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-03-04 16:42:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:42:29,618 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:29,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:42:29,618 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:29,618 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-03-04 16:42:29,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:29,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:29,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:29,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:29,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:29,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:29,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,680 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:29,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:29,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:29,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:42:29,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:29,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:42:29,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:29,703 INFO L453 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 21 treesize of output 24 [2019-03-04 16:42:29,728 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:42:29,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,785 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:29,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,798 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:29,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,816 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:29,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:42:29,839 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,853 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,867 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,880 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,893 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,907 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:42:29,957 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,965 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,981 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,001 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,028 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,071 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:30,071 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:42:30,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:42:30,099 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,141 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:30,141 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-03-04 16:42:30,187 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 50 [2019-03-04 16:42:30,188 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:42:30,240 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:42:30,241 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:110 [2019-03-04 16:42:40,349 WARN L181 SmtUtils]: Spent 10.10 s on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-03-04 16:42:40,376 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:42:40,377 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:40,395 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:40,395 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-03-04 16:42:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:40,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:40,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:42:40,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:40,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:40,470 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-03-04 16:42:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:44,457 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-03-04 16:42:44,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:44,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:42:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:44,471 INFO L225 Difference]: With dead ends: 4300 [2019-03-04 16:42:44,471 INFO L226 Difference]: Without dead ends: 4298 [2019-03-04 16:42:44,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:42:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-03-04 16:42:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-03-04 16:42:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-03-04 16:42:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-03-04 16:42:48,123 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-03-04 16:42:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:48,123 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-03-04 16:42:48,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:42:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-03-04 16:42:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:42:48,129 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:48,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:48,130 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-03-04 16:42:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:48,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:48,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:48,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:48,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:48,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:42:48,209 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-03-04 16:42:48,210 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:48,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:48,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:48,214 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:48,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:48,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:48,215 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:48,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:48,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:48,244 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:42:48,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:48,250 INFO L453 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 21 treesize of output 24 [2019-03-04 16:42:48,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,256 INFO L453 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 24 treesize of output 26 [2019-03-04 16:42:48,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,272 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:48,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,290 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:48,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:48,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:42:48,329 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,344 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,357 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,372 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,386 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,399 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,457 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:48,457 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,462 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,469 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,483 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,505 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,533 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,578 INFO L309 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-03-04 16:42:48,578 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:42:48,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:42:48,621 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,670 INFO L309 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-03-04 16:42:48,671 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:42:48,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:42:48,726 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,764 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:48,764 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:42:48,825 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:42:48,826 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,851 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:48,851 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-03-04 16:42:48,928 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 51 [2019-03-04 16:42:48,929 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,951 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:48,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:47 [2019-03-04 16:42:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:48,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:49,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:49,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:42:49,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:49,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:42:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:42:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:49,056 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-03-04 16:42:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:53,369 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-03-04 16:42:53,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:53,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:42:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:53,384 INFO L225 Difference]: With dead ends: 4236 [2019-03-04 16:42:53,384 INFO L226 Difference]: Without dead ends: 4233 [2019-03-04 16:42:53,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:42:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-03-04 16:42:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-03-04 16:42:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-03-04 16:42:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-03-04 16:42:57,051 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-03-04 16:42:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:57,051 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-03-04 16:42:57,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:42:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-03-04 16:42:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:42:57,059 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:57,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:57,059 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-03-04 16:42:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:57,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:57,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:57,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:57,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:57,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:42:57,156 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-03-04 16:42:57,156 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:57,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:57,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:57,158 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:57,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:57,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:57,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:57,158 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:57,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:57,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:57,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:42:57,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:57,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:42:57,207 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,212 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,222 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,237 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,256 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:42:57,283 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:42:57,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:42:57,289 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:42:57,293 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:57,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:42:57,333 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,343 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,355 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,366 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,378 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,388 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,420 INFO L309 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-03-04 16:42:57,420 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-03-04 16:42:57,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:57,488 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,517 INFO L309 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-03-04 16:42:57,518 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:42:57,556 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:42:57,557 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,578 INFO L309 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-03-04 16:42:57,578 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:42:57,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:42:57,631 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,650 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:57,650 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:42:57,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:42:57,714 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,731 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:57,731 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:42:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:57,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:57,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:57,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:42:57,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:57,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:42:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:42:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:42:57,836 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-03-04 16:43:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:01,955 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-03-04 16:43:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:43:01,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:43:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:01,970 INFO L225 Difference]: With dead ends: 4232 [2019-03-04 16:43:01,970 INFO L226 Difference]: Without dead ends: 4231 [2019-03-04 16:43:01,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:43:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-03-04 16:43:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-03-04 16:43:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-03-04 16:43:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-03-04 16:43:05,606 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-03-04 16:43:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:05,606 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-03-04 16:43:05,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:43:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-03-04 16:43:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:43:05,613 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:05,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:05,613 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:05,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-03-04 16:43:05,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:05,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:05,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:05,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:05,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:05,790 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:43:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:05,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:05,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:05,844 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:43:05,844 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-03-04 16:43:05,845 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:05,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:05,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:05,847 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:43:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:05,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:05,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:05,848 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:05,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:05,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:05,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:43:05,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:05,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:43:05,905 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:05,916 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:05,936 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:05,966 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:05,999 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:43:06,055 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:43:06,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:43:06,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:43:06,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:43:06,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:43:06,079 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,091 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,103 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,114 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,126 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,138 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,181 INFO L309 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-03-04 16:43:06,181 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:43:06,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:43:06,217 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,258 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:06,259 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:43:06,317 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:43:06,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:43:06,376 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:43:06,377 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:110 [2019-03-04 16:43:06,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:43:06,459 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,481 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:06,482 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:38 [2019-03-04 16:43:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:06,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:06,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:06,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:43:06,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:06,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:43:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:43:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:43:06,556 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-03-04 16:43:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:10,650 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-03-04 16:43:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:43:10,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:43:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:10,669 INFO L225 Difference]: With dead ends: 4570 [2019-03-04 16:43:10,669 INFO L226 Difference]: Without dead ends: 4569 [2019-03-04 16:43:10,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:43:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-03-04 16:43:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-03-04 16:43:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-03-04 16:43:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-03-04 16:43:14,494 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-03-04 16:43:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:14,495 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-03-04 16:43:14,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:43:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-03-04 16:43:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:43:14,502 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:14,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:14,502 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-03-04 16:43:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:14,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:14,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:14,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:14,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:14,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:43:14,721 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-03-04 16:43:14,721 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:14,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:14,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:14,724 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:43:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:14,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:14,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:14,724 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:14,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:14,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:14,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:43:14,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:14,778 INFO L453 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 21 treesize of output 24 [2019-03-04 16:43:14,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,787 INFO L453 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 24 treesize of output 26 [2019-03-04 16:43:14,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,793 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:43:14,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,805 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:43:14,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,822 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:43:14,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:14,845 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:43:14,845 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,859 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,873 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,886 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,900 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,914 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,967 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:43:14,968 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,977 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:14,992 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,010 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,036 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,065 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,111 INFO L309 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-03-04 16:43:15,111 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:43:15,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:43:15,155 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,198 INFO L309 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-03-04 16:43:15,199 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:43:15,244 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:43:15,245 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,487 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:15,487 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:43:15,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:43:15,577 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,603 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:15,603 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:43:15,674 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 53 [2019-03-04 16:43:15,675 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:15,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-03-04 16:43:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:15,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:15,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:15,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:43:15,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:15,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:43:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:43:15,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:43:15,833 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-03-04 16:43:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:21,707 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-03-04 16:43:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:43:21,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:43:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:21,729 INFO L225 Difference]: With dead ends: 5928 [2019-03-04 16:43:21,729 INFO L226 Difference]: Without dead ends: 5927 [2019-03-04 16:43:21,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:43:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-03-04 16:43:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-03-04 16:43:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-03-04 16:43:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-03-04 16:43:27,005 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-03-04 16:43:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:27,006 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-03-04 16:43:27,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:43:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-03-04 16:43:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:43:27,013 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:27,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:27,014 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-03-04 16:43:27,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:27,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:27,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:27,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:27,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:43:27,156 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-03-04 16:43:27,160 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:27,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:27,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:27,162 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:43:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:27,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:27,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:27,162 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:27,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:27,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:27,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:43:27,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:27,180 INFO L453 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 21 treesize of output 24 [2019-03-04 16:43:27,194 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:43:27,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,203 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:43:27,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:43:27,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:43:27,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,284 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:43:27,284 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,297 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,310 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,323 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,336 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,348 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,387 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:43:27,387 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,391 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,401 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,417 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,447 INFO L309 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-03-04 16:43:27,447 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-03-04 16:43:27,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:27,498 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,524 INFO L309 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-03-04 16:43:27,525 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 16:43:27,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:43:27,573 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:43:27,612 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:43:27,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:76 [2019-03-04 16:43:27,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:43:27,708 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,778 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:43:27,779 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,808 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:43:27,809 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:74 [2019-03-04 16:43:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:27,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:27,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:43:27,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:27,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:43:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:43:27,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:43:27,942 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-03-04 16:43:28,221 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-03-04 16:43:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:34,911 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-03-04 16:43:34,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:43:34,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:43:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:34,934 INFO L225 Difference]: With dead ends: 6511 [2019-03-04 16:43:34,934 INFO L226 Difference]: Without dead ends: 6510 [2019-03-04 16:43:34,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:43:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-03-04 16:43:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-03-04 16:43:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-03-04 16:43:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-03-04 16:43:41,566 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-03-04 16:43:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:41,566 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-03-04 16:43:41,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:43:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-03-04 16:43:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:43:41,575 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:41,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:41,575 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-03-04 16:43:41,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:41,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:41,743 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-03-04 16:43:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:41,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:41,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:41,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:43:41,938 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-03-04 16:43:41,939 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:41,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:41,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:41,941 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:43:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:41,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:41,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:41,942 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:41,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:41,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:41,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:43:41,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:42,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:43:42,014 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,020 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,032 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,049 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,077 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,112 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:43:42,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:43:42,129 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:43:42,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:43:42,141 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:43:42,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:43:42,148 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,160 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,172 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,184 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,196 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,208 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,251 INFO L309 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-03-04 16:43:42,252 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-03-04 16:43:42,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:42,323 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,351 INFO L309 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-03-04 16:43:42,352 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:43:42,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:43:42,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,418 INFO L309 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-03-04 16:43:42,418 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:43:42,482 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:43:42,483 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,501 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:42,502 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 16:43:42,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 56 [2019-03-04 16:43:42,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:42,595 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:42,595 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:43:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:42,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:42,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:42,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-03-04 16:43:42,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:42,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:43:42,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:43:42,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:43:42,716 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-03-04 16:43:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:51,417 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-03-04 16:43:51,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:43:51,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:43:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:51,444 INFO L225 Difference]: With dead ends: 7179 [2019-03-04 16:43:51,444 INFO L226 Difference]: Without dead ends: 7170 [2019-03-04 16:43:51,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:43:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-03-04 16:43:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-03-04 16:43:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-03-04 16:43:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-03-04 16:43:58,204 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-03-04 16:43:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:58,204 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-03-04 16:43:58,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:43:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-03-04 16:43:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:43:58,212 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:58,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:58,213 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-03-04 16:43:58,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:58,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:58,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:58,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:58,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:58,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:58,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:43:58,267 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-03-04 16:43:58,268 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:58,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:58,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:58,271 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:43:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:58,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:58,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:58,271 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:58,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:58,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:58,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:43:58,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:58,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:43:58,312 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,325 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,339 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,363 INFO L453 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 21 treesize of output 24 [2019-03-04 16:43:58,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:43:58,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 34 [2019-03-04 16:43:58,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 28 treesize of output 39 [2019-03-04 16:43:58,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:43:58,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:43:58,449 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,461 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,474 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,484 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,497 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,508 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:58,538 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-03-04 16:43:58,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 41 treesize of output 57 [2019-03-04 16:43:58,593 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:43:58,728 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-03-04 16:43:58,728 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:389 [2019-03-04 16:43:58,849 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 20 [2019-03-04 16:43:58,859 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:43:58,860 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:58,868 INFO L309 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-03-04 16:43:58,868 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-03-04 16:43:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:58,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:58,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:58,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:43:58,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:58,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:43:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:43:58,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:43:58,918 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-03-04 16:44:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:08,626 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-03-04 16:44:08,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:44:08,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:44:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:08,670 INFO L225 Difference]: With dead ends: 10441 [2019-03-04 16:44:08,670 INFO L226 Difference]: Without dead ends: 10440 [2019-03-04 16:44:08,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:44:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-03-04 16:44:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-03-04 16:44:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-03-04 16:44:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-03-04 16:44:18,906 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-03-04 16:44:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:18,906 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-03-04 16:44:18,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:44:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-03-04 16:44:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:44:18,917 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:18,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:44:18,917 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-03-04 16:44:18,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:18,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:18,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:44:19,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:19,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:19,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:44:19,078 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-03-04 16:44:19,079 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:44:19,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:44:19,081 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:44:19,081 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:44:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:19,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:44:19,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:19,082 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:44:19,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:19,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:19,102 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:44:19,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:19,106 INFO L453 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 21 treesize of output 24 [2019-03-04 16:44:19,124 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:44:19,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,132 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:44:19,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:44:19,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,163 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:44:19,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:44:19,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:44:19,186 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,198 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,211 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,225 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,238 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,251 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:44:19,301 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,305 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,314 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,331 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,357 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,399 INFO L309 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-03-04 16:44:19,399 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:44:19,447 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:44:19,447 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,487 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:19,487 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:44:19,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:44:19,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:19,560 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:44:19,560 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:59 [2019-03-04 16:44:19,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:44:19,638 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:44:19,695 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-03-04 16:44:19,696 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:118 [2019-03-04 16:44:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:21,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:21,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:21,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:44:21,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:21,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:44:21,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:44:21,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=114, Unknown=1, NotChecked=0, Total=182 [2019-03-04 16:44:21,856 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-03-04 16:44:33,494 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:44:33,495 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-03-04 16:44:33,499 INFO L168 Benchmark]: Toolchain (without parser) took 332387.53 ms. Allocated memory was 135.3 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 110.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 997.4 MB. Max. memory is 7.1 GB. [2019-03-04 16:44:33,499 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:44:33,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 135.3 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:44:33,500 INFO L168 Benchmark]: Boogie Preprocessor took 23.68 ms. Allocated memory is still 135.3 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:44:33,500 INFO L168 Benchmark]: RCFGBuilder took 415.71 ms. Allocated memory is still 135.3 MB. Free memory was 106.6 MB in the beginning and 95.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:44:33,500 INFO L168 Benchmark]: TraceAbstraction took 331884.71 ms. Allocated memory was 135.3 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 95.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 982.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:44:33,502 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.22 ms. Allocated memory is still 135.3 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 135.3 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.68 ms. Allocated memory is still 135.3 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.71 ms. Allocated memory is still 135.3 MB. Free memory was 106.6 MB in the beginning and 95.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 331884.71 ms. Allocated memory was 135.3 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 95.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 982.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...