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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:20,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:20,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:20,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:20,899 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:20,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:20,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:20,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:20,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:20,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:20,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:20,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:20,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:20,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:20,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:20,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:20,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:20,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:20,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:20,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:20,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:20,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:20,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:20,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:20,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:20,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:20,947 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:20,948 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:20,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:20,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:20,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:20,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:20,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:20,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:20,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:20,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:20,957 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:38:20,970 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:20,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:20,971 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:20,971 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:20,971 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:20,972 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:20,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:20,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:20,974 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:20,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:20,975 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:20,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:20,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:20,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:20,975 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:20,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:20,977 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:20,979 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:20,979 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:21,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:21,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:21,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:21,051 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:21,051 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:21,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-03-04 16:38:21,052 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-03-04 16:38:21,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:21,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:21,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:21,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:21,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:21,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:21,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:21,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:21,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:21,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (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:38:21,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-03-04 16:38:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:21,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:21,440 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:21,441 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-03-04 16:38:21,442 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21 BoogieIcfgContainer [2019-03-04 16:38:21,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:21,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:21,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:21,447 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:21,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/2) ... [2019-03-04 16:38:21,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2963191b and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:21, skipping insertion in model container [2019-03-04 16:38:21,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21" (2/2) ... [2019-03-04 16:38:21,450 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-03-04 16:38:21,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:21,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:38:21,485 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:38:21,523 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:21,523 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:21,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:21,524 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:21,524 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:21,524 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:21,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:21,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-03-04 16:38:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:21,555 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:21,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:21,560 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:21,568 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-03-04 16:38:21,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:21,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:21,807 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:38:21,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:21,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:38:21,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:21,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:38:21,832 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-03-04 16:38:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:21,988 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-03-04 16:38:21,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:21,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-03-04 16:38:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:22,001 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:38:22,002 INFO L226 Difference]: Without dead ends: 13 [2019-03-04 16:38:22,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:38:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-03-04 16:38:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-03-04 16:38:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:38:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-03-04 16:38:22,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-03-04 16:38:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-03-04 16:38:22,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-03-04 16:38:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:38:22,045 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:22,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:22,046 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:22,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,046 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-03-04 16:38:22,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:22,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,149 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:38:22,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:22,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-03-04 16:38:22,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:22,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:38:22,153 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-03-04 16:38:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:22,258 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-03-04 16:38:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:22,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-03-04 16:38:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:22,260 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:38:22,260 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:38:22,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:38:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:38:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-03-04 16:38:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:38:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-03-04 16:38:22,267 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-03-04 16:38:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:22,268 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-03-04 16:38:22,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-03-04 16:38:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:38:22,269 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:22,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:22,269 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-03-04 16:38:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,325 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:38:22,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:22,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:38:22,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:22,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:22,327 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-03-04 16:38:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:22,358 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-03-04 16:38:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:22,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-03-04 16:38:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:22,362 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:38:22,362 INFO L226 Difference]: Without dead ends: 13 [2019-03-04 16:38:22,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:38:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-03-04 16:38:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-03-04 16:38:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:38:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-03-04 16:38:22,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-03-04 16:38:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:22,366 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-03-04 16:38:22,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-03-04 16:38:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:38:22,367 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:22,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:22,368 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-03-04 16:38:22,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:22,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,637 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-03-04 16:38:22,807 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:38:22,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:22,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:22,811 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:38:22,813 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-03-04 16:38:22,865 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:22,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:23,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:23,005 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:23,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,012 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:38:23,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:23,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:23,133 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:38:23,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:23,219 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:38:23,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:23,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-03-04 16:38:23,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:23,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:38:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:38:23,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:23,246 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-03-04 16:38:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:23,496 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-03-04 16:38:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:23,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-03-04 16:38:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:23,499 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:38:23,499 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:38:23,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:38:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-03-04 16:38:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:38:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-03-04 16:38:23,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-03-04 16:38:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:23,504 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-03-04 16:38:23,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:38:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-03-04 16:38:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-03-04 16:38:23,505 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:23,505 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:23,506 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-03-04 16:38:23,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:23,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:23,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:23,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-03-04 16:38:23,580 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-03-04 16:38:23,583 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:23,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:23,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:23,638 INFO L272 AbstractInterpreter]: Visited 12 different actions 94 times. Merged at 11 different actions 69 times. Widened at 3 different actions 7 times. Found 15 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:38:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:23,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,639 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:38:23,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:23,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:23,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:23,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:23,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-03-04 16:38:23,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:23,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:23,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:23,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:23,818 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-03-04 16:38:24,160 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-03-04 16:38:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:24,255 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-03-04 16:38:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:24,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-03-04 16:38:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:24,257 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:38:24,257 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:38:24,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:38:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-03-04 16:38:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:38:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-03-04 16:38:24,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-03-04 16:38:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:24,264 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-03-04 16:38:24,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-03-04 16:38:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-03-04 16:38:24,265 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:24,265 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:24,265 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-03-04 16:38:24,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:24,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:24,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:24,578 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:38:24,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,579 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:38:24,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:24,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:24,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:38:24,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:24,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:38:24,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:24,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:24,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:24,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-03-04 16:38:24,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:24,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:38:24,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:38:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:24,808 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-03-04 16:38:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:25,079 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-03-04 16:38:25,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:38:25,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-03-04 16:38:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:25,080 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:38:25,080 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:38:25,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:38:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:38:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-03-04 16:38:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:38:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-03-04 16:38:25,086 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-03-04 16:38:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:25,087 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-03-04 16:38:25,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:38:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-03-04 16:38:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-03-04 16:38:25,087 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:25,088 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-03-04 16:38:25,088 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-03-04 16:38:25,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:25,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:25,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:25,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:25,206 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:38:25,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:25,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 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:38:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:25,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:25,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:25,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:25,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:25,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:25,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:25,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:25,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-03-04 16:38:25,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:25,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:38:25,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:38:25,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:25,338 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-03-04 16:38:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:25,448 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-03-04 16:38:25,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:25,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-03-04 16:38:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:25,450 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:25,450 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:38:25,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:38:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-03-04 16:38:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:38:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-03-04 16:38:25,456 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-03-04 16:38:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:25,456 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-03-04 16:38:25,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:38:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-03-04 16:38:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-03-04 16:38:25,457 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:25,457 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-03-04 16:38:25,457 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-03-04 16:38:25,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:25,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:25,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:25,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:25,685 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:38:25,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:25,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 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:38:25,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:25,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:25,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:38:25,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:25,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:25,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-03-04 16:38:25,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:25,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:38:25,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:38:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:25,954 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-03-04 16:38:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:26,346 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-03-04 16:38:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:38:26,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-03-04 16:38:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:26,351 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:38:26,351 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:38:26,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:38:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:38:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-03-04 16:38:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:38:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-03-04 16:38:26,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-03-04 16:38:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:26,358 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-03-04 16:38:26,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:38:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-03-04 16:38:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-03-04 16:38:26,359 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:26,359 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-03-04 16:38:26,359 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-03-04 16:38:26,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:26,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:26,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:26,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:26,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:26,487 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:38:26,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,487 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:38:26,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:26,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:26,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:38:26,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:26,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:38:26,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:26,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:26,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:26,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-03-04 16:38:26,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:26,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:38:26,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:38:26,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:26,651 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-03-04 16:38:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:27,372 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-03-04 16:38:27,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:38:27,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-03-04 16:38:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:27,374 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:38:27,374 INFO L226 Difference]: Without dead ends: 33 [2019-03-04 16:38:27,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:38:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-03-04 16:38:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-03-04 16:38:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:38:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-03-04 16:38:27,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-03-04 16:38:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:27,381 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-03-04 16:38:27,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:38:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-03-04 16:38:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:38:27,382 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:27,382 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-03-04 16:38:27,382 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-03-04 16:38:27,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:27,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:27,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:27,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:27,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:27,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:27,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:27,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:27,809 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:38:27,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:27,810 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:38:27,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:27,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:27,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:27,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:27,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:38:27,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:27,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:28,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:28,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-03-04 16:38:28,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:28,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-03-04 16:38:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-03-04 16:38:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:38:28,048 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-03-04 16:38:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:28,551 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-03-04 16:38:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:38:28,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-03-04 16:38:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:28,552 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:38:28,552 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:38:28,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-03-04 16:38:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:38:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-03-04 16:38:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:38:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-03-04 16:38:28,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-03-04 16:38:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:28,560 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-03-04 16:38:28,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-03-04 16:38:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-03-04 16:38:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-03-04 16:38:28,561 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:28,561 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-03-04 16:38:28,561 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:28,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-03-04 16:38:28,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:29,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:29,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:29,006 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:38:29,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:29,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 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:38:29,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:29,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:29,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:38:29,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:29,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-03-04 16:38:29,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:29,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-03-04 16:38:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-03-04 16:38:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:38:29,268 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-03-04 16:38:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:29,646 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-03-04 16:38:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:38:29,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-03-04 16:38:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:29,647 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:38:29,647 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:38:29,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:38:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:38:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-03-04 16:38:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:38:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-03-04 16:38:29,654 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-03-04 16:38:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:29,654 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-03-04 16:38:29,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-03-04 16:38:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-03-04 16:38:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-03-04 16:38:29,656 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:29,656 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-03-04 16:38:29,656 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:29,656 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-03-04 16:38:29,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:29,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:29,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:29,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:29,924 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:38:29,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:29,924 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:38:29,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:29,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:29,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-03-04 16:38:29,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:29,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:38:29,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:30,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:31,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-03-04 16:38:31,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:31,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-03-04 16:38:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-03-04 16:38:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:38:31,173 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-03-04 16:38:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:33,339 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-03-04 16:38:33,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:38:33,339 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-03-04 16:38:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:33,340 INFO L225 Difference]: With dead ends: 97 [2019-03-04 16:38:33,340 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:38:33,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-03-04 16:38:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:38:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-03-04 16:38:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:38:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-03-04 16:38:33,350 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-03-04 16:38:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:33,351 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-03-04 16:38:33,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-03-04 16:38:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-03-04 16:38:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-03-04 16:38:33,352 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:33,352 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-03-04 16:38:33,353 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:33,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-03-04 16:38:33,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:33,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:33,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:33,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:33,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:33,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:33,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:33,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:33,812 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:38:33,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:33,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:33,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:33,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:33,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:33,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:33,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-03-04 16:38:33,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,123 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:34,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-03-04 16:38:34,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:34,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-03-04 16:38:34,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-03-04 16:38:34,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:38:34,178 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-03-04 16:38:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:35,470 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-03-04 16:38:35,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:38:35,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-03-04 16:38:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:35,472 INFO L225 Difference]: With dead ends: 94 [2019-03-04 16:38:35,472 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:38:35,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:38:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:38:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-03-04 16:38:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:38:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-03-04 16:38:35,482 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-03-04 16:38:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:35,482 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-03-04 16:38:35,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-03-04 16:38:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-03-04 16:38:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-03-04 16:38:35,483 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:35,483 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-03-04 16:38:35,483 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-03-04 16:38:35,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:35,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:35,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:35,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:35,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:35,627 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:38:35,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:35,627 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:38:35,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:35,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:35,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:38:35,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:35,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-03-04 16:38:35,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:35,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-03-04 16:38:35,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-03-04 16:38:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:38:35,943 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-03-04 16:38:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:36,197 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-03-04 16:38:36,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:38:36,197 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-03-04 16:38:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:36,199 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:38:36,199 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:38:36,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:38:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:38:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-03-04 16:38:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:38:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-03-04 16:38:36,208 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-03-04 16:38:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:36,209 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-03-04 16:38:36,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-03-04 16:38:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-03-04 16:38:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-03-04 16:38:36,210 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:36,210 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-03-04 16:38:36,210 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-03-04 16:38:36,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:36,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:36,572 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:38:36,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,572 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:38:36,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:36,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:36,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-03-04 16:38:36,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:36,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:38:36,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:36,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-03-04 16:38:36,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:36,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:38:36,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:38:36,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:38:36,929 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-03-04 16:38:37,892 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-03-04 16:38:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:38,375 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-03-04 16:38:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:38:38,375 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-03-04 16:38:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:38,376 INFO L225 Difference]: With dead ends: 109 [2019-03-04 16:38:38,376 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:38:38,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-03-04 16:38:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:38:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-03-04 16:38:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:38:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-03-04 16:38:38,388 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-03-04 16:38:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:38,388 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-03-04 16:38:38,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:38:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-03-04 16:38:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-03-04 16:38:38,389 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:38,389 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-03-04 16:38:38,390 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:38,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,390 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-03-04 16:38:38,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:38,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:38,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:38,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:38,673 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:38:38,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,674 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:38:38,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:38,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:38,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:38,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:38,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:38:38,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:39,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-03-04 16:38:39,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:39,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:38:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:38:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:38:39,037 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-03-04 16:38:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:39,349 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-03-04 16:38:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:38:39,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-03-04 16:38:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:39,350 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:38:39,350 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:38:39,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:38:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:38:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-03-04 16:38:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:38:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-03-04 16:38:39,360 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-03-04 16:38:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:39,360 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-03-04 16:38:39,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:38:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-03-04 16:38:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-03-04 16:38:39,362 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:39,362 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-03-04 16:38:39,362 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:39,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-03-04 16:38:39,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:39,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:39,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:39,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:39,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:39,783 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:38:39,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:39,784 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:38:39,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:39,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:39,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-03-04 16:38:39,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:40,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-03-04 16:38:40,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:40,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-03-04 16:38:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-03-04 16:38:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:38:40,183 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-03-04 16:38:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:41,660 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-03-04 16:38:41,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:38:41,661 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-03-04 16:38:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:41,662 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:38:41,662 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:38:41,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-03-04 16:38:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:38:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-03-04 16:38:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-03-04 16:38:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-03-04 16:38:41,673 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-03-04 16:38:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:41,674 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-03-04 16:38:41,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-03-04 16:38:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-03-04 16:38:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-03-04 16:38:41,675 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:41,675 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-03-04 16:38:41,675 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-03-04 16:38:41,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:41,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:41,917 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:38:41,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,917 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:38:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:41,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:41,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-03-04 16:38:41,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:41,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:38:41,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:42,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:42,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:42,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-03-04 16:38:42,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:42,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-03-04 16:38:42,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-03-04 16:38:42,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:38:42,351 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-03-04 16:38:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:42,893 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-03-04 16:38:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:38:42,893 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-03-04 16:38:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:42,894 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:38:42,894 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:38:42,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:38:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:38:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-03-04 16:38:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:38:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-03-04 16:38:42,923 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-03-04 16:38:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:42,923 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-03-04 16:38:42,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-03-04 16:38:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-03-04 16:38:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-03-04 16:38:42,926 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:42,926 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-03-04 16:38:42,926 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-03-04 16:38:42,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:43,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:43,579 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:38:43,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,579 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:38:43,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:43,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:43,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:43,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:43,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-03-04 16:38:43,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:43,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-03-04 16:38:43,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:43,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:38:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:38:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:38:43,944 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-03-04 16:38:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:45,698 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-03-04 16:38:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:38:45,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-03-04 16:38:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:45,699 INFO L225 Difference]: With dead ends: 139 [2019-03-04 16:38:45,699 INFO L226 Difference]: Without dead ends: 105 [2019-03-04 16:38:45,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:38:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-03-04 16:38:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-03-04 16:38:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-03-04 16:38:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-03-04 16:38:45,710 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-03-04 16:38:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:45,710 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-03-04 16:38:45,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:38:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-03-04 16:38:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-03-04 16:38:45,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:45,711 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-03-04 16:38:45,711 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-03-04 16:38:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:45,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:45,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:45,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:45,952 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:38:45,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:45,952 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:38:45,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:45,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:38:45,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:46,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:46,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-03-04 16:38:46,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:46,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:38:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:38:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:38:46,812 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-03-04 16:38:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:47,235 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-03-04 16:38:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:38:47,235 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-03-04 16:38:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:47,236 INFO L225 Difference]: With dead ends: 150 [2019-03-04 16:38:47,236 INFO L226 Difference]: Without dead ends: 75 [2019-03-04 16:38:47,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-03-04 16:38:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-03-04 16:38:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-03-04 16:38:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:38:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-03-04 16:38:47,257 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-03-04 16:38:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:47,258 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-03-04 16:38:47,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:38:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-03-04 16:38:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:38:47,259 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:47,259 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-03-04 16:38:47,259 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:47,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-03-04 16:38:47,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:47,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:47,762 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:38:47,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,762 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:38:47,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:47,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:47,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-03-04 16:38:47,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:47,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:38:47,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:49,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-03-04 16:38:49,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:49,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:38:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:38:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:38:49,748 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-03-04 16:38:52,213 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-03-04 16:38:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:54,321 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-03-04 16:38:54,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:38:54,322 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-03-04 16:38:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:54,323 INFO L225 Difference]: With dead ends: 192 [2019-03-04 16:38:54,323 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:38:54,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:38:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:38:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-03-04 16:38:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:38:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-03-04 16:38:54,336 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-03-04 16:38:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:54,336 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-03-04 16:38:54,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:38:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-03-04 16:38:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-03-04 16:38:54,337 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:54,338 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-03-04 16:38:54,338 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-03-04 16:38:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:55,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:55,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:55,476 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:38:55,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:55,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 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:38:55,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:55,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:55,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:55,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:55,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-03-04 16:38:55,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:56,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-03-04 16:38:56,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:56,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:38:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:38:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:38:56,199 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-03-04 16:38:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:58,357 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-03-04 16:38:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:38:58,360 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-03-04 16:38:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:58,362 INFO L225 Difference]: With dead ends: 169 [2019-03-04 16:38:58,362 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:38:58,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:38:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:38:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-03-04 16:38:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:38:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-03-04 16:38:58,371 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-03-04 16:38:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:58,371 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-03-04 16:38:58,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:38:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-03-04 16:38:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-03-04 16:38:58,372 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:58,372 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-03-04 16:38:58,372 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-03-04 16:38:58,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:58,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:58,807 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:38:58,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,807 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:38:58,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:58,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:58,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:38:58,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:59,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:59,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-03-04 16:38:59,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:59,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:38:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:38:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:38:59,297 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-03-04 16:38:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:59,824 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-03-04 16:38:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:38:59,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-03-04 16:38:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:59,825 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:38:59,825 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:38:59,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:38:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:38:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-03-04 16:38:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-03-04 16:38:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-03-04 16:38:59,835 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-03-04 16:38:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:59,836 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-03-04 16:38:59,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:38:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-03-04 16:38:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-03-04 16:38:59,837 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:59,837 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-03-04 16:38:59,837 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-03-04 16:38:59,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:59,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:59,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:59,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:59,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:00,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:00,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:00,419 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:00,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,419 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:00,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:00,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:00,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-03-04 16:39:00,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:00,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjunts are in the unsatisfiable core [2019-03-04 16:39:00,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:01,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:02,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:02,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-03-04 16:39:02,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:02,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-03-04 16:39:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-03-04 16:39:02,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-03-04 16:39:02,605 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-03-04 16:39:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:09,158 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-03-04 16:39:09,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 16:39:09,158 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-03-04 16:39:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:09,160 INFO L225 Difference]: With dead ends: 230 [2019-03-04 16:39:09,160 INFO L226 Difference]: Without dead ends: 135 [2019-03-04 16:39:09,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-03-04 16:39:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-03-04 16:39:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-03-04 16:39:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:39:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-03-04 16:39:09,177 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-03-04 16:39:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:09,177 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-03-04 16:39:09,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-03-04 16:39:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-03-04 16:39:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-03-04 16:39:09,178 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:09,178 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-03-04 16:39:09,178 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:09,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-03-04 16:39:09,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:09,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:09,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:09,891 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:09,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,891 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:09,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:09,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:09,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:09,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:09,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:39:09,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:10,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:10,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:10,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-03-04 16:39:10,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:10,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:39:10,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:39:10,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:39:10,525 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-03-04 16:39:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:13,674 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-03-04 16:39:13,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:39:13,675 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-03-04 16:39:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:13,676 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:39:13,676 INFO L226 Difference]: Without dead ends: 149 [2019-03-04 16:39:13,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:39:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-03-04 16:39:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-03-04 16:39:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-03-04 16:39:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-03-04 16:39:13,689 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-03-04 16:39:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:13,689 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-03-04 16:39:13,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:39:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-03-04 16:39:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-03-04 16:39:13,690 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:13,690 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-03-04 16:39:13,690 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-03-04 16:39:13,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:13,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:14,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:14,159 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:14,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,159 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:14,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2019-03-04 16:39:14,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:15,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-03-04 16:39:15,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:15,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:39:15,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:39:15,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:39:15,367 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-03-04 16:39:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:16,043 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-03-04 16:39:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:39:16,043 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-03-04 16:39:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:16,044 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:39:16,044 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:39:16,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:39:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:39:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-03-04 16:39:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:39:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-03-04 16:39:16,060 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-03-04 16:39:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:16,060 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-03-04 16:39:16,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:39:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-03-04 16:39:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-03-04 16:39:16,061 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:16,061 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-03-04 16:39:16,061 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-03-04 16:39:16,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:16,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:16,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:17,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:17,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:17,109 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:17,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,110 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:17,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:17,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:17,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-03-04 16:39:17,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:17,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 59 conjunts are in the unsatisfiable core [2019-03-04 16:39:17,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:17,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:17,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:17,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-03-04 16:39:17,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:17,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:39:17,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:39:17,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:39:17,998 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-03-04 16:39:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:21,637 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-03-04 16:39:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:39:21,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-03-04 16:39:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:21,639 INFO L225 Difference]: With dead ends: 214 [2019-03-04 16:39:21,639 INFO L226 Difference]: Without dead ends: 160 [2019-03-04 16:39:21,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-03-04 16:39:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-03-04 16:39:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-03-04 16:39:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-03-04 16:39:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-03-04 16:39:21,657 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-03-04 16:39:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:21,658 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-03-04 16:39:21,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:39:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-03-04 16:39:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-03-04 16:39:21,658 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:21,658 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-03-04 16:39:21,658 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:21,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-03-04 16:39:21,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:21,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:21,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:22,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:22,030 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:22,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,030 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:22,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:22,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:22,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:22,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:22,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-03-04 16:39:22,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:22,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-03-04 16:39:22,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:22,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:39:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:39:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:39:22,752 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-03-04 16:39:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:23,351 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-03-04 16:39:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:39:23,351 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-03-04 16:39:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:23,352 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:39:23,352 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:39:23,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:39:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:39:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-03-04 16:39:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:39:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-03-04 16:39:23,373 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-03-04 16:39:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:23,373 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-03-04 16:39:23,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:39:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-03-04 16:39:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-03-04 16:39:23,374 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:23,374 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-03-04 16:39:23,375 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:23,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:23,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-03-04 16:39:23,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:23,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:23,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:24,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:24,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:24,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:24,465 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:24,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:24,465 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:24,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:24,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:24,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 63 conjunts are in the unsatisfiable core [2019-03-04 16:39:24,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,123 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:25,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-03-04 16:39:25,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:25,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:39:25,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:39:25,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:39:25,281 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-03-04 16:39:29,787 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-03-04 16:39:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:30,087 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-03-04 16:39:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:39:30,088 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-03-04 16:39:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:30,089 INFO L225 Difference]: With dead ends: 229 [2019-03-04 16:39:30,089 INFO L226 Difference]: Without dead ends: 171 [2019-03-04 16:39:30,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:39:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-03-04 16:39:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-03-04 16:39:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:39:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-03-04 16:39:30,111 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-03-04 16:39:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:30,111 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-03-04 16:39:30,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:39:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-03-04 16:39:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-03-04 16:39:30,112 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:30,112 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-03-04 16:39:30,112 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:30,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-03-04 16:39:30,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:30,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:30,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:30,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:30,552 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:30,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,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 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:30,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:30,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:30,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-03-04 16:39:30,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:30,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:39:30,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:31,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-03-04 16:39:31,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:31,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:39:31,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:39:31,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:39:31,399 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-03-04 16:39:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:31,968 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-03-04 16:39:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:39:31,969 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-03-04 16:39:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:31,970 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:39:31,970 INFO L226 Difference]: Without dead ends: 117 [2019-03-04 16:39:31,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:39:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-03-04 16:39:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-03-04 16:39:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-03-04 16:39:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-03-04 16:39:31,986 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-03-04 16:39:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:31,986 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-03-04 16:39:31,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:39:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-03-04 16:39:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-03-04 16:39:31,987 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:31,987 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-03-04 16:39:31,987 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-03-04 16:39:31,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:31,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:31,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:32,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:32,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:32,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:32,770 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:32,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:32,771 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:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:32,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:32,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:32,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:32,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:39:32,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:33,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-03-04 16:39:33,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:33,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-03-04 16:39:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-03-04 16:39:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:39:33,614 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-03-04 16:39:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:38,856 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-03-04 16:39:38,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:39:38,856 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-03-04 16:39:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:38,858 INFO L225 Difference]: With dead ends: 244 [2019-03-04 16:39:38,858 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:39:38,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-03-04 16:39:38,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:39:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-03-04 16:39:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-03-04 16:39:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-03-04 16:39:38,877 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-03-04 16:39:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:38,878 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-03-04 16:39:38,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-03-04 16:39:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-03-04 16:39:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-03-04 16:39:38,879 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:38,879 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-03-04 16:39:38,879 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-03-04 16:39:38,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:38,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:38,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:38,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:38,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:39,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:39,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:39,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:39,806 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:39,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:39,806 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:39,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:39,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:39,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2019-03-04 16:39:39,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:40,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-03-04 16:39:40,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:40,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-03-04 16:39:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-03-04 16:39:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:39:40,729 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-03-04 16:39:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:41,623 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-03-04 16:39:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:39:41,623 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-03-04 16:39:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:41,625 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:39:41,625 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:39:41,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:39:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:39:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-03-04 16:39:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-03-04 16:39:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-03-04 16:39:41,645 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-03-04 16:39:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:41,645 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-03-04 16:39:41,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-03-04 16:39:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-03-04 16:39:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-03-04 16:39:41,646 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:41,646 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-03-04 16:39:41,646 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-03-04 16:39:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:41,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:41,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:41,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:42,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:42,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:42,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:42,596 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:42,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:42,596 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:42,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:42,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:42,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-03-04 16:39:42,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:42,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:39:42,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:44,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:46,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:46,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-03-04 16:39:46,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:46,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-03-04 16:39:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-03-04 16:39:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:39:46,613 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-03-04 16:39:54,807 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-03-04 16:39:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:56,700 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-03-04 16:39:56,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-03-04 16:39:56,701 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-03-04 16:39:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:56,703 INFO L225 Difference]: With dead ends: 325 [2019-03-04 16:39:56,703 INFO L226 Difference]: Without dead ends: 190 [2019-03-04 16:39:56,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:39:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-03-04 16:39:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-03-04 16:39:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-03-04 16:39:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-03-04 16:39:56,722 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-03-04 16:39:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:56,722 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-03-04 16:39:56,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-03-04 16:39:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-03-04 16:39:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-03-04 16:39:56,723 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:56,723 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-03-04 16:39:56,724 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-03-04 16:39:56,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:57,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:57,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:57,827 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:57,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,827 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:57,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:57,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:57,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:57,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:57,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-03-04 16:39:57,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:58,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:58,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:58,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-03-04 16:39:58,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:58,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-03-04 16:39:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-03-04 16:39:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:39:58,898 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-03-04 16:40:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:04,719 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-03-04 16:40:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:40:04,719 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-03-04 16:40:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:04,721 INFO L225 Difference]: With dead ends: 274 [2019-03-04 16:40:04,721 INFO L226 Difference]: Without dead ends: 204 [2019-03-04 16:40:04,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:40:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-03-04 16:40:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-03-04 16:40:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:40:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-03-04 16:40:04,740 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-03-04 16:40:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:04,741 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-03-04 16:40:04,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-03-04 16:40:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-03-04 16:40:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:40:04,741 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:04,741 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-03-04 16:40:04,741 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-03-04 16:40:04,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:04,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:04,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:05,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:05,567 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:05,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,568 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:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:05,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:40:05,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:06,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:06,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:06,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-03-04 16:40:06,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:06,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-03-04 16:40:06,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-03-04 16:40:06,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:40:06,849 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-03-04 16:40:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:07,718 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-03-04 16:40:07,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:40:07,719 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-03-04 16:40:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:07,720 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:40:07,720 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:40:07,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:40:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:40:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-03-04 16:40:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:40:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-03-04 16:40:07,742 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-03-04 16:40:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:07,742 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-03-04 16:40:07,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-03-04 16:40:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-03-04 16:40:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:40:07,742 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:07,743 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-03-04 16:40:07,743 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-03-04 16:40:07,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:07,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:07,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:08,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:08,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:08,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:08,783 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:08,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:08,783 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:08,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:08,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:08,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-03-04 16:40:08,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:08,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2019-03-04 16:40:08,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:11,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:13,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:13,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-03-04 16:40:13,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:13,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-03-04 16:40:13,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-03-04 16:40:13,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:40:13,680 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-03-04 16:40:24,770 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:40:25,062 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:40:25,436 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-03-04 16:40:25,733 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-03-04 16:40:25,977 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-03-04 16:40:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:27,788 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-03-04 16:40:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-03-04 16:40:27,789 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-03-04 16:40:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:27,791 INFO L225 Difference]: With dead ends: 363 [2019-03-04 16:40:27,791 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:40:27,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-03-04 16:40:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:40:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-03-04 16:40:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-03-04 16:40:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-03-04 16:40:27,820 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-03-04 16:40:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:27,820 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-03-04 16:40:27,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-03-04 16:40:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-03-04 16:40:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-03-04 16:40:27,821 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:27,821 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-03-04 16:40:27,821 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-03-04 16:40:27,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:29,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:29,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:29,098 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:29,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,098 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:29,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:29,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:29,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:29,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:29,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 83 conjunts are in the unsatisfiable core [2019-03-04 16:40:29,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:30,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:31,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:31,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-03-04 16:40:31,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:31,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-03-04 16:40:31,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-03-04 16:40:31,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:40:31,045 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-03-04 16:40:35,229 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:40:35,520 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:40:35,849 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:40:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:37,683 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-03-04 16:40:37,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 16:40:37,683 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-03-04 16:40:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:37,685 INFO L225 Difference]: With dead ends: 304 [2019-03-04 16:40:37,685 INFO L226 Difference]: Without dead ends: 226 [2019-03-04 16:40:37,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-03-04 16:40:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-03-04 16:40:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-03-04 16:40:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-03-04 16:40:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-03-04 16:40:37,717 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-03-04 16:40:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:37,717 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-03-04 16:40:37,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-03-04 16:40:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-03-04 16:40:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-03-04 16:40:37,718 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:37,719 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-03-04 16:40:37,719 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-03-04 16:40:37,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:38,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:38,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:38,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:38,615 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:38,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:38,615 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:38,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:38,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:38,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-03-04 16:40:38,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:39,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-03-04 16:40:39,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:39,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-03-04 16:40:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-03-04 16:40:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:40:39,988 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-03-04 16:40:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:41,576 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-03-04 16:40:41,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:40:41,576 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-03-04 16:40:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:41,578 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:40:41,578 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:40:41,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:40:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:40:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-03-04 16:40:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-03-04 16:40:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-03-04 16:40:41,612 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-03-04 16:40:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:41,612 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-03-04 16:40:41,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-03-04 16:40:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-03-04 16:40:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-03-04 16:40:41,613 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:41,613 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-03-04 16:40:41,614 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:41,614 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-03-04 16:40:41,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:43,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:43,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:43,902 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:43,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,902 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:43,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:43,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:44,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-03-04 16:40:44,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:44,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-03-04 16:40:44,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:46,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:49,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:49,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-03-04 16:40:49,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:49,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-03-04 16:40:49,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-03-04 16:40:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:40:49,440 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-03-04 16:41:01,298 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:41:01,650 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:41:01,957 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:41:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:04,851 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-03-04 16:41:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-03-04 16:41:04,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-03-04 16:41:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:04,853 INFO L225 Difference]: With dead ends: 401 [2019-03-04 16:41:04,853 INFO L226 Difference]: Without dead ends: 234 [2019-03-04 16:41:04,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-03-04 16:41:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-03-04 16:41:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-03-04 16:41:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:41:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-03-04 16:41:04,881 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-03-04 16:41:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:04,881 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-03-04 16:41:04,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-03-04 16:41:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-03-04 16:41:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:41:04,882 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:04,882 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-03-04 16:41:04,882 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-03-04 16:41:04,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:04,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:04,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:04,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:04,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:06,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:06,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:06,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:06,854 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:06,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:06,854 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:41:06,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:41:06,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:41:06,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:41:06,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:06,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:41:06,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:08,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:08,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:08,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-03-04 16:41:08,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:08,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-03-04 16:41:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-03-04 16:41:08,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:41:08,339 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-03-04 16:41:14,005 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:41:14,317 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:41:14,617 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:41:14,818 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:41:15,005 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:41:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:17,053 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-03-04 16:41:17,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 16:41:17,053 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-03-04 16:41:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:17,055 INFO L225 Difference]: With dead ends: 334 [2019-03-04 16:41:17,055 INFO L226 Difference]: Without dead ends: 248 [2019-03-04 16:41:17,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-03-04 16:41:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-03-04 16:41:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-03-04 16:41:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:41:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-03-04 16:41:17,095 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-03-04 16:41:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:17,096 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-03-04 16:41:17,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-03-04 16:41:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-03-04 16:41:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-03-04 16:41:17,097 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:17,097 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-03-04 16:41:17,097 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:17,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-03-04 16:41:17,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:18,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:18,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:18,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:18,398 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:18,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:18,398 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:41:18,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:18,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:18,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-03-04 16:41:18,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:19,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:20,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:20,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-03-04 16:41:20,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:20,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-03-04 16:41:20,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-03-04 16:41:20,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:41:20,291 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-03-04 16:41:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:22,022 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-03-04 16:41:22,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:41:22,024 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-03-04 16:41:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:22,026 INFO L225 Difference]: With dead ends: 345 [2019-03-04 16:41:22,026 INFO L226 Difference]: Without dead ends: 166 [2019-03-04 16:41:22,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:41:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-03-04 16:41:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-03-04 16:41:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-03-04 16:41:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-03-04 16:41:22,053 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-03-04 16:41:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:22,053 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-03-04 16:41:22,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-03-04 16:41:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-03-04 16:41:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-03-04 16:41:22,054 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:22,054 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-03-04 16:41:22,054 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-03-04 16:41:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:22,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:22,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:23,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:23,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:23,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:23,760 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:23,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:23,760 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:41:23,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:23,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:23,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-03-04 16:41:23,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:23,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 95 conjunts are in the unsatisfiable core [2019-03-04 16:41:23,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:25,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:25,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:25,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-03-04 16:41:25,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:25,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:41:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:41:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:41:25,306 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-03-04 16:41:32,272 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:41:32,604 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:41:32,910 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:41:33,120 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:41:33,317 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:41:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:35,567 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-03-04 16:41:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 16:41:35,567 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-03-04 16:41:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:35,568 INFO L225 Difference]: With dead ends: 349 [2019-03-04 16:41:35,568 INFO L226 Difference]: Without dead ends: 259 [2019-03-04 16:41:35,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:41:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-03-04 16:41:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-03-04 16:41:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-03-04 16:41:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-03-04 16:41:35,596 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-03-04 16:41:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:35,596 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-03-04 16:41:35,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:41:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-03-04 16:41:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-03-04 16:41:35,597 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:35,597 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-03-04 16:41:35,597 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:35,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-03-04 16:41:35,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:35,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:35,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:35,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:35,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:36,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:36,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:36,730 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,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,730 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:41:36,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:41:36,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:41:36,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:41:36,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:36,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-03-04 16:41:36,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:37,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:38,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:38,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-03-04 16:41:38,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:38,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:41:38,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:41:38,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:41:38,716 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-03-04 16:41:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:40,427 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-03-04 16:41:40,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:41:40,427 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-03-04 16:41:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:40,428 INFO L225 Difference]: With dead ends: 360 [2019-03-04 16:41:40,429 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:41:40,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:41:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:41:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-03-04 16:41:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-03-04 16:41:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-03-04 16:41:40,457 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-03-04 16:41:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:40,457 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-03-04 16:41:40,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:41:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-03-04 16:41:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-03-04 16:41:40,458 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:40,458 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-03-04 16:41:40,458 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-03-04 16:41:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:40,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:40,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:41,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:41,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:41,948 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:41,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,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 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:41:41,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:41,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:41,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 99 conjunts are in the unsatisfiable core [2019-03-04 16:41:41,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:43,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-03-04 16:41:43,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:43,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-03-04 16:41:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-03-04 16:41:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:41:43,841 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-03-04 16:41:51,080 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:41:51,427 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:41:51,747 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:41:51,968 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:41:52,190 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:41:52,434 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:41:52,664 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:41:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:54,724 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-03-04 16:41:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 16:41:54,724 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-03-04 16:41:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:54,726 INFO L225 Difference]: With dead ends: 364 [2019-03-04 16:41:54,726 INFO L226 Difference]: Without dead ends: 270 [2019-03-04 16:41:54,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:41:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-03-04 16:41:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-03-04 16:41:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-03-04 16:41:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-03-04 16:41:54,755 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-03-04 16:41:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:54,756 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-03-04 16:41:54,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-03-04 16:41:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-03-04 16:41:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-03-04 16:41:54,756 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:54,757 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-03-04 16:41:54,757 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-03-04 16:41:54,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:54,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:54,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:55,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:55,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:55,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:55,793 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:55,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:55,793 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:41:55,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:55,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:55,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-03-04 16:41:55,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:55,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:41:55,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:57,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:58,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:58,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-03-04 16:41:58,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:58,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-03-04 16:41:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-03-04 16:41:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:41:58,126 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-03-04 16:41:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:59,936 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-03-04 16:41:59,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:41:59,936 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-03-04 16:41:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:59,938 INFO L225 Difference]: With dead ends: 375 [2019-03-04 16:41:59,938 INFO L226 Difference]: Without dead ends: 180 [2019-03-04 16:41:59,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:41:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-03-04 16:41:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-03-04 16:41:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:41:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-03-04 16:41:59,969 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-03-04 16:41:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:59,969 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-03-04 16:41:59,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-03-04 16:41:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-03-04 16:41:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-03-04 16:41:59,970 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:59,970 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-03-04 16:41:59,970 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-03-04 16:41:59,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:59,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:59,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:59,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:02,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:02,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:02,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:02,112 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:02,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:02,112 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:42:02,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:42:02,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:42:02,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:42:02,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:02,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:42:02,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:04,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:04,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:04,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-03-04 16:42:04,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:04,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:42:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:42:04,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:42:04,179 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-03-04 16:42:10,176 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:42:10,523 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:42:10,869 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:42:11,097 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:42:11,314 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:42:11,523 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:42:11,727 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:42:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:14,046 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-03-04 16:42:14,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:42:14,046 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-03-04 16:42:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:14,047 INFO L225 Difference]: With dead ends: 379 [2019-03-04 16:42:14,047 INFO L226 Difference]: Without dead ends: 281 [2019-03-04 16:42:14,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-03-04 16:42:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-03-04 16:42:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-03-04 16:42:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-03-04 16:42:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-03-04 16:42:14,094 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-03-04 16:42:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:14,094 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-03-04 16:42:14,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:42:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-03-04 16:42:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-03-04 16:42:14,095 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:14,095 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-03-04 16:42:14,095 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-03-04 16:42:14,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:14,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:14,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:14,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:14,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:15,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:15,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:15,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:15,110 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:15,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:15,111 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:42:15,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:15,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:15,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2019-03-04 16:42:15,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:16,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:17,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:17,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-03-04 16:42:17,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:17,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:42:17,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:42:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:42:17,083 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-03-04 16:42:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:19,071 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-03-04 16:42:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:42:19,071 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-03-04 16:42:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:19,073 INFO L225 Difference]: With dead ends: 390 [2019-03-04 16:42:19,073 INFO L226 Difference]: Without dead ends: 187 [2019-03-04 16:42:19,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:42:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-03-04 16:42:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-03-04 16:42:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:42:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-03-04 16:42:19,106 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-03-04 16:42:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:19,107 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-03-04 16:42:19,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:42:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-03-04 16:42:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-03-04 16:42:19,107 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:19,107 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-03-04 16:42:19,108 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-03-04 16:42:19,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:19,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:19,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:20,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:20,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:20,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:20,816 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:20,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:20,816 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:42:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:20,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:20,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-03-04 16:42:20,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:20,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:42:20,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:25,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:28,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:28,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-03-04 16:42:28,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:28,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-03-04 16:42:28,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-03-04 16:42:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-03-04 16:42:28,861 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-03-04 16:42:45,365 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:42:45,780 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:42:46,218 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:42:46,587 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:42:46,935 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:42:47,284 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:42:47,609 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:42:47,921 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:42:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:51,233 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-03-04 16:42:51,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-03-04 16:42:51,233 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-03-04 16:42:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:51,235 INFO L225 Difference]: With dead ends: 496 [2019-03-04 16:42:51,235 INFO L226 Difference]: Without dead ends: 289 [2019-03-04 16:42:51,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-03-04 16:42:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-03-04 16:42:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-03-04 16:42:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-03-04 16:42:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-03-04 16:42:51,271 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-03-04 16:42:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:51,272 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-03-04 16:42:51,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-03-04 16:42:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-03-04 16:42:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-03-04 16:42:51,272 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:51,272 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-03-04 16:42:51,273 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-03-04 16:42:51,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:51,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:51,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:53,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:53,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:53,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:53,045 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:53,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:53,045 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:42:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:42:53,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:42:53,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:42:53,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:53,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-03-04 16:42:53,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:54,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:55,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:55,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-03-04 16:42:55,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:55,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:42:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:42:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:42:55,274 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-03-04 16:43:03,025 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:43:03,411 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:43:03,783 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:43:04,047 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:43:04,314 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:43:04,553 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:43:04,783 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:43:05,007 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:43:05,218 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:43:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:07,616 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-03-04 16:43:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-03-04 16:43:07,617 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-03-04 16:43:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:07,618 INFO L225 Difference]: With dead ends: 409 [2019-03-04 16:43:07,618 INFO L226 Difference]: Without dead ends: 303 [2019-03-04 16:43:07,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:43:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-03-04 16:43:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-03-04 16:43:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-03-04 16:43:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-03-04 16:43:07,656 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-03-04 16:43:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:07,656 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-03-04 16:43:07,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:43:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-03-04 16:43:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-03-04 16:43:07,657 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:07,657 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-03-04 16:43:07,658 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-03-04 16:43:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:07,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:07,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:08,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:08,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:08,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:08,654 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:43:08,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:08,654 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:43:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:08,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:08,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:43:08,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:10,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-03-04 16:43:11,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:11,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:43:11,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:43:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:43:11,183 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-03-04 16:43:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:13,342 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-03-04 16:43:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:43:13,343 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-03-04 16:43:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:13,344 INFO L225 Difference]: With dead ends: 420 [2019-03-04 16:43:13,344 INFO L226 Difference]: Without dead ends: 201 [2019-03-04 16:43:13,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:43:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-03-04 16:43:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-03-04 16:43:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-03-04 16:43:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-03-04 16:43:13,380 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-03-04 16:43:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:13,380 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-03-04 16:43:13,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:43:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-03-04 16:43:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-03-04 16:43:13,381 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:13,381 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-03-04 16:43:13,382 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-03-04 16:43:13,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:13,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:13,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:13,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:13,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:15,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:15,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:15,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:15,206 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:43:15,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:15,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 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:43:15,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:15,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:15,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-03-04 16:43:15,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:15,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:43:15,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:17,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:17,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:17,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-03-04 16:43:17,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:17,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-03-04 16:43:17,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-03-04 16:43:17,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:43:17,391 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-03-04 16:43:25,350 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:43:25,755 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:43:26,142 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:43:26,417 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:43:26,684 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:43:26,953 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:43:27,197 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:43:27,439 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:43:27,670 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:43:27,893 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:43:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:30,345 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-03-04 16:43:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-03-04 16:43:30,345 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-03-04 16:43:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:30,346 INFO L225 Difference]: With dead ends: 424 [2019-03-04 16:43:30,347 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:43:30,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-03-04 16:43:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:43:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-03-04 16:43:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-03-04 16:43:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-03-04 16:43:30,396 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-03-04 16:43:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:30,396 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-03-04 16:43:30,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-03-04 16:43:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-03-04 16:43:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-03-04 16:43:30,397 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:30,397 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-03-04 16:43:30,398 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-03-04 16:43:30,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:30,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:30,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:30,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:30,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:31,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:31,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:31,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:31,631 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:43:31,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:31,632 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:43:31,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:43:31,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:43:31,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:43:31,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:31,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2019-03-04 16:43:31,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:32,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:33,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:33,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-03-04 16:43:33,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:33,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-03-04 16:43:33,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-03-04 16:43:33,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:43:33,996 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-03-04 16:43:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:36,331 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-03-04 16:43:36,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:43:36,332 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-03-04 16:43:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:36,333 INFO L225 Difference]: With dead ends: 435 [2019-03-04 16:43:36,333 INFO L226 Difference]: Without dead ends: 208 [2019-03-04 16:43:36,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:43:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-03-04 16:43:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-03-04 16:43:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-03-04 16:43:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-03-04 16:43:36,381 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-03-04 16:43:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:36,381 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-03-04 16:43:36,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-03-04 16:43:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-03-04 16:43:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-03-04 16:43:36,382 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:36,382 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-03-04 16:43:36,382 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-03-04 16:43:36,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:36,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:36,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:38,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:38,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:38,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:38,320 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:43:38,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:38,320 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:43:38,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:38,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:38,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 119 conjunts are in the unsatisfiable core [2019-03-04 16:43:38,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:40,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:40,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-03-04 16:43:40,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:40,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:43:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:43:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:43:40,638 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-03-04 16:43:48,935 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:43:49,362 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:43:49,770 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:43:50,058 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:43:50,339 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:43:50,608 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:43:50,872 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:43:51,124 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:43:51,372 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:43:51,610 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:43:51,838 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:43:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:54,372 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-03-04 16:43:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-03-04 16:43:54,372 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-03-04 16:43:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:54,374 INFO L225 Difference]: With dead ends: 439 [2019-03-04 16:43:54,375 INFO L226 Difference]: Without dead ends: 325 [2019-03-04 16:43:54,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:43:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-03-04 16:43:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-03-04 16:43:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-03-04 16:43:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-03-04 16:43:54,420 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-03-04 16:43:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:54,420 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-03-04 16:43:54,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:43:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-03-04 16:43:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-03-04 16:43:54,422 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:54,422 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-03-04 16:43:54,422 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-03-04 16:43:54,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:54,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:54,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:56,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:56,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:56,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:56,232 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:43:56,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:56,232 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:43:56,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:56,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:56,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-03-04 16:43:56,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:56,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 62 conjunts are in the unsatisfiable core [2019-03-04 16:43:56,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:57,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:58,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:58,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-03-04 16:43:58,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:58,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:43:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:43:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:43:58,968 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-03-04 16:44:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:01,477 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-03-04 16:44:01,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:44:01,478 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-03-04 16:44:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:01,479 INFO L225 Difference]: With dead ends: 450 [2019-03-04 16:44:01,479 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:44:01,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:44:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:44:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-03-04 16:44:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-03-04 16:44:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-03-04 16:44:01,545 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-03-04 16:44:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:01,545 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-03-04 16:44:01,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:44:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-03-04 16:44:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-03-04 16:44:01,547 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:01,547 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-03-04 16:44:01,547 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-03-04 16:44:01,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:01,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:01,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:03,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:03,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:03,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:03,627 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:44:03,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:03,627 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:44:03,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:44:03,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:44:03,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:44:03,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:03,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-03-04 16:44:03,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:06,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:06,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:06,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-03-04 16:44:06,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-03-04 16:44:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-03-04 16:44:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:44:06,414 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-03-04 16:44:15,797 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:44:16,235 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:44:16,658 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:44:16,976 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:44:17,266 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:44:17,544 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:44:17,820 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:44:18,088 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:44:18,344 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:44:18,598 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:44:18,840 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:44:19,069 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:44:19,291 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:44:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:21,737 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-03-04 16:44:21,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-03-04 16:44:21,738 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-03-04 16:44:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:21,740 INFO L225 Difference]: With dead ends: 454 [2019-03-04 16:44:21,740 INFO L226 Difference]: Without dead ends: 336 [2019-03-04 16:44:21,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:44:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-03-04 16:44:21,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-03-04 16:44:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:44:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-03-04 16:44:21,790 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-03-04 16:44:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:21,790 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-03-04 16:44:21,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-03-04 16:44:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-03-04 16:44:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:44:21,791 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:21,791 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-03-04 16:44:21,791 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:21,791 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-03-04 16:44:21,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:21,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:21,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:21,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:21,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:23,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:23,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:23,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:23,120 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:44:23,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:23,120 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:44:23,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:23,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:23,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:44:23,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:24,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:25,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:25,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-03-04 16:44:25,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:25,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-03-04 16:44:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-03-04 16:44:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:44:25,766 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-03-04 16:44:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:28,405 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-03-04 16:44:28,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:44:28,406 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-03-04 16:44:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:28,407 INFO L225 Difference]: With dead ends: 465 [2019-03-04 16:44:28,407 INFO L226 Difference]: Without dead ends: 222 [2019-03-04 16:44:28,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:44:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-03-04 16:44:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-03-04 16:44:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:44:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-03-04 16:44:28,449 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-03-04 16:44:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:28,449 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-03-04 16:44:28,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-03-04 16:44:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-03-04 16:44:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-03-04 16:44:28,450 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:28,450 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-03-04 16:44:28,451 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-03-04 16:44:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:28,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:28,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:30,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:30,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:30,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:30,642 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:44:30,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:30,642 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:44:30,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:44:30,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:44:30,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-03-04 16:44:30,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:30,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 68 conjunts are in the unsatisfiable core [2019-03-04 16:44:30,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:36,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:41,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:41,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-03-04 16:44:41,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:41,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-03-04 16:44:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-03-04 16:44:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:44:41,497 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-03-04 16:45:03,976 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:45:04,536 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:45:05,123 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:45:05,610 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:45:06,069 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:45:06,542 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:45:07,007 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:45:07,433 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:45:07,841 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:45:08,242 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:45:08,629 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:45:09,029 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:45:09,385 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:45:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:13,139 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-03-04 16:45:13,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-03-04 16:45:13,139 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-03-04 16:45:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:13,141 INFO L225 Difference]: With dead ends: 591 [2019-03-04 16:45:13,141 INFO L226 Difference]: Without dead ends: 344 [2019-03-04 16:45:13,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-03-04 16:45:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-03-04 16:45:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-03-04 16:45:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-03-04 16:45:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-03-04 16:45:13,190 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-03-04 16:45:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:13,190 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-03-04 16:45:13,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-03-04 16:45:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-03-04 16:45:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-03-04 16:45:13,191 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:13,191 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-03-04 16:45:13,191 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:13,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:13,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-03-04 16:45:13,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:13,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:13,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:45:13,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:13,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:15,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:15,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:15,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:15,471 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:45:15,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:15,471 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:45:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:45:15,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:45:15,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:45:15,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:45:15,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 131 conjunts are in the unsatisfiable core [2019-03-04 16:45:15,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:17,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:18,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:18,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-03-04 16:45:18,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:18,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-03-04 16:45:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-03-04 16:45:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:45:18,187 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-03-04 16:45:29,946 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 16:45:30,427 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 16:45:30,890 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:45:31,225 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:45:31,552 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:45:31,872 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:45:32,203 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:45:32,501 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:45:32,793 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:45:33,078 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:45:33,349 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:45:33,611 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:45:33,864 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:45:34,114 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:45:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:36,903 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-03-04 16:45:36,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-03-04 16:45:36,903 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-03-04 16:45:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:36,905 INFO L225 Difference]: With dead ends: 484 [2019-03-04 16:45:36,905 INFO L226 Difference]: Without dead ends: 358 [2019-03-04 16:45:36,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:45:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-03-04 16:45:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-03-04 16:45:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-03-04 16:45:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-03-04 16:45:36,955 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-03-04 16:45:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:36,955 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-03-04 16:45:36,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-03-04 16:45:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-03-04 16:45:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-03-04 16:45:36,957 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:36,957 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-03-04 16:45:36,957 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-03-04 16:45:36,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:36,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:45:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:36,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:38,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:38,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:38,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:38,385 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:45:38,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:38,385 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:45:38,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:38,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:45:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:38,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2019-03-04 16:45:38,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:42,222 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:43,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-03-04 16:45:43,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:43,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-03-04 16:45:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-03-04 16:45:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:45:43,691 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-03-04 16:45:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:45,885 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-03-04 16:45:45,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:45:45,885 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-03-04 16:45:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:45,887 INFO L225 Difference]: With dead ends: 495 [2019-03-04 16:45:45,887 INFO L226 Difference]: Without dead ends: 236 [2019-03-04 16:45:45,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:45:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-03-04 16:45:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-03-04 16:45:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-03-04 16:45:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-03-04 16:45:45,936 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-03-04 16:45:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:45,936 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-03-04 16:45:45,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-03-04 16:45:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-03-04 16:45:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-03-04 16:45:45,938 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:45,938 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-03-04 16:45:45,938 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-03-04 16:45:45,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:45,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:45,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:48,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:48,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:48,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:48,415 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:45:48,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:48,415 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:45:48,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:45:48,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:45:48,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-03-04 16:45:48,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:45:48,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 72 conjunts are in the unsatisfiable core [2019-03-04 16:45:48,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:54,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:00,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:00,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-03-04 16:46:00,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:00,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-03-04 16:46:00,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-03-04 16:46:00,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:46:00,662 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-03-04 16:46:24,172 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 16:46:24,753 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 16:46:25,352 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 16:46:25,876 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:46:26,396 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:46:26,910 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:46:27,398 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:46:27,864 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:46:28,337 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:46:28,831 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:46:29,259 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:46:29,674 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:46:30,072 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:46:30,456 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:46:30,819 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:46:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:34,741 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-03-04 16:46:34,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-03-04 16:46:34,741 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-03-04 16:46:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:34,743 INFO L225 Difference]: With dead ends: 629 [2019-03-04 16:46:34,743 INFO L226 Difference]: Without dead ends: 366 [2019-03-04 16:46:34,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-03-04 16:46:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-03-04 16:46:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-03-04 16:46:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:46:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-03-04 16:46:34,797 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-03-04 16:46:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:34,797 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-03-04 16:46:34,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-03-04 16:46:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-03-04 16:46:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:46:34,799 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:34,799 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-03-04 16:46:34,799 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-03-04 16:46:34,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:34,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:46:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:34,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:37,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:37,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:37,315 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:46:37,315 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:46:37,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:37,316 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:46:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:46:37,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:46:37,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:46:37,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:46:37,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 16:46:37,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:40,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:40,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:40,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-03-04 16:46:40,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:40,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-03-04 16:46:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-03-04 16:46:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:46:40,342 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-03-04 16:46:51,327 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 16:46:51,850 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 16:46:52,381 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 16:46:52,750 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:46:53,103 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:46:53,447 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:46:53,778 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:46:54,102 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:46:54,426 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:46:54,745 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:46:55,051 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:46:55,349 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:46:55,630 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:46:55,911 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:46:56,184 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:46:56,437 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:46:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:59,393 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-03-04 16:46:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-03-04 16:46:59,393 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-03-04 16:46:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:59,395 INFO L225 Difference]: With dead ends: 514 [2019-03-04 16:46:59,396 INFO L226 Difference]: Without dead ends: 380 [2019-03-04 16:46:59,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 16:46:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-03-04 16:46:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-03-04 16:46:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-03-04 16:46:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-03-04 16:46:59,451 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-03-04 16:46:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:59,451 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-03-04 16:46:59,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-03-04 16:46:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-03-04 16:46:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-03-04 16:46:59,452 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:59,452 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-03-04 16:46:59,452 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-03-04 16:46:59,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:59,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:46:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:59,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:00,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:00,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:00,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:47:00,951 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:47:00,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:00,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 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:47:00,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:00,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:47:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:01,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 72 conjunts are in the unsatisfiable core [2019-03-04 16:47:01,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:02,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:04,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:04,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-03-04 16:47:04,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:04,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-03-04 16:47:04,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-03-04 16:47:04,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:47:04,306 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-03-04 16:47:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:06,791 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-03-04 16:47:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:47:06,792 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-03-04 16:47:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:06,793 INFO L225 Difference]: With dead ends: 525 [2019-03-04 16:47:06,794 INFO L226 Difference]: Without dead ends: 250 [2019-03-04 16:47:06,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 16:47:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-03-04 16:47:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-03-04 16:47:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-03-04 16:47:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-03-04 16:47:06,854 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-03-04 16:47:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:06,855 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-03-04 16:47:06,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-03-04 16:47:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-03-04 16:47:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-03-04 16:47:06,856 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:06,856 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-03-04 16:47:06,856 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-03-04 16:47:06,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:06,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:06,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:09,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:09,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:47:09,516 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:47:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:09,516 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:47:09,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:47:09,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:47:09,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-03-04 16:47:09,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:47:09,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:47:09,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:16,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:23,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:23,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-03-04 16:47:23,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:23,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-03-04 16:47:23,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-03-04 16:47:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:47:23,107 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-03-04 16:47:48,745 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 16:47:49,371 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 16:47:50,006 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 16:47:50,595 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:47:51,171 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:47:51,717 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:47:52,244 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:47:52,772 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:47:53,287 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:47:53,783 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:47:54,269 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:47:54,741 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:47:55,257 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:47:55,694 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:47:56,107 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:47:56,508 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:47:56,896 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:48:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:01,011 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-03-04 16:48:01,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-03-04 16:48:01,011 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-03-04 16:48:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:01,013 INFO L225 Difference]: With dead ends: 667 [2019-03-04 16:48:01,013 INFO L226 Difference]: Without dead ends: 388 [2019-03-04 16:48:01,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-03-04 16:48:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-03-04 16:48:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-03-04 16:48:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-03-04 16:48:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-03-04 16:48:01,075 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-03-04 16:48:01,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:01,075 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-03-04 16:48:01,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-03-04 16:48:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-03-04 16:48:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-03-04 16:48:01,077 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:01,077 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-03-04 16:48:01,077 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-03-04 16:48:01,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:01,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:48:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:01,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:03,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:03,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:03,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:03,964 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:48:03,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:03,965 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:48:03,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:48:03,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:48:04,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:48:04,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:48:04,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 147 conjunts are in the unsatisfiable core [2019-03-04 16:48:04,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:07,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:07,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:07,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-03-04 16:48:07,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:07,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-03-04 16:48:07,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-03-04 16:48:07,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:48:07,327 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-03-04 16:48:20,219 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 16:48:20,777 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 16:48:21,336 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 16:48:21,735 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:48:22,125 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:48:22,506 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:48:22,869 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:48:23,230 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:48:23,582 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:48:23,923 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:48:24,261 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:48:24,584 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:48:24,903 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:48:25,211 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:48:25,509 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:48:25,801 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:48:26,103 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:48:26,365 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:48:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:29,387 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-03-04 16:48:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-03-04 16:48:29,388 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-03-04 16:48:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:29,390 INFO L225 Difference]: With dead ends: 544 [2019-03-04 16:48:29,390 INFO L226 Difference]: Without dead ends: 402 [2019-03-04 16:48:29,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 16:48:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-03-04 16:48:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-03-04 16:48:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-03-04 16:48:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-03-04 16:48:29,451 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-03-04 16:48:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:29,451 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-03-04 16:48:29,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-03-04 16:48:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-03-04 16:48:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-03-04 16:48:29,452 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:29,453 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-03-04 16:48:29,453 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-03-04 16:48:29,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:29,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:48:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:29,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:31,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:31,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:31,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:31,103 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:48:31,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:31,103 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:48:31,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:48:31,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:48:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:31,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:48:31,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:33,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:34,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:34,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-03-04 16:48:34,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:34,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-03-04 16:48:34,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-03-04 16:48:34,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:48:34,759 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-03-04 16:48:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:37,483 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-03-04 16:48:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:48:37,483 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-03-04 16:48:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:37,485 INFO L225 Difference]: With dead ends: 555 [2019-03-04 16:48:37,485 INFO L226 Difference]: Without dead ends: 264 [2019-03-04 16:48:37,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:48:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-03-04 16:48:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-03-04 16:48:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-03-04 16:48:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-03-04 16:48:37,544 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-03-04 16:48:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:37,544 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-03-04 16:48:37,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-03-04 16:48:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-03-04 16:48:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-03-04 16:48:37,545 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:37,545 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-03-04 16:48:37,546 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-03-04 16:48:37,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:37,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:37,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:48:37,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:37,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:40,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:40,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:40,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:40,528 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:48:40,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:40,529 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:48:40,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:48:40,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:48:40,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-03-04 16:48:40,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:48:40,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 80 conjunts are in the unsatisfiable core [2019-03-04 16:48:40,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:48,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:55,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-03-04 16:48:55,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:55,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-03-04 16:48:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-03-04 16:48:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:48:55,583 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-03-04 16:49:24,365 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 16:49:25,063 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 16:49:25,773 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 16:49:26,493 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:49:27,122 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:49:27,741 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:49:28,342 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:49:28,918 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:49:29,467 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:49:30,024 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:49:30,561 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:49:31,081 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:49:31,582 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:49:32,062 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:49:32,535 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:49:32,991 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:49:33,435 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:49:33,856 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:49:34,257 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:49:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:38,662 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-03-04 16:49:38,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-03-04 16:49:38,662 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-03-04 16:49:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:38,664 INFO L225 Difference]: With dead ends: 705 [2019-03-04 16:49:38,664 INFO L226 Difference]: Without dead ends: 410 [2019-03-04 16:49:38,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-03-04 16:49:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-03-04 16:49:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-03-04 16:49:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-03-04 16:49:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-03-04 16:49:38,735 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-03-04 16:49:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:38,735 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-03-04 16:49:38,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-03-04 16:49:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-03-04 16:49:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-03-04 16:49:38,736 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:38,736 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-03-04 16:49:38,736 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:38,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-03-04 16:49:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:38,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:49:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:38,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:41,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:41,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:41,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:49:41,779 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:49:41,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:41,780 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:49:41,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:49:41,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:49:41,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:49:41,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:49:41,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-03-04 16:49:41,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:45,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:45,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:45,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-03-04 16:49:45,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:45,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-03-04 16:49:45,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-03-04 16:49:45,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:49:45,493 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-03-04 16:50:00,476 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 16:50:01,084 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 16:50:01,677 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 16:50:02,106 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-03-04 16:50:02,531 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:50:02,941 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:50:03,349 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:50:03,743 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:50:04,158 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:50:04,593 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:50:04,966 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:50:05,322 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:50:05,666 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:50:06,000 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:50:06,333 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:50:06,653 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:50:06,962 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:50:07,263 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:50:07,554 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:50:07,839 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:50:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:50:11,056 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-03-04 16:50:11,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-03-04 16:50:11,056 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-03-04 16:50:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:50:11,058 INFO L225 Difference]: With dead ends: 574 [2019-03-04 16:50:11,058 INFO L226 Difference]: Without dead ends: 424 [2019-03-04 16:50:11,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 16:50:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-03-04 16:50:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-03-04 16:50:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-03-04 16:50:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-03-04 16:50:11,140 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-03-04 16:50:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:50:11,140 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-03-04 16:50:11,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-03-04 16:50:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-03-04 16:50:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-03-04 16:50:11,141 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:50:11,142 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-03-04 16:50:11,142 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:50:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:50:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-03-04 16:50:11,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:50:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:50:11,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:50:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:50:11,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:50:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:50:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:50:12,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:50:12,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:50:12,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:50:12,960 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:50:12,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:50:12,960 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:50:12,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:50:12,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:50:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:50:13,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 80 conjunts are in the unsatisfiable core [2019-03-04 16:50:13,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:50:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:50:15,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:50:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:50:17,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:50:17,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-03-04 16:50:17,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:50:17,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-03-04 16:50:17,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-03-04 16:50:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:50:17,013 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-03-04 16:50:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:50:20,090 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-03-04 16:50:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 16:50:20,091 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-03-04 16:50:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:50:20,093 INFO L225 Difference]: With dead ends: 585 [2019-03-04 16:50:20,093 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 16:50:20,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:50:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 16:50:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-03-04 16:50:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-03-04 16:50:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-03-04 16:50:20,194 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-03-04 16:50:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:50:20,195 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-03-04 16:50:20,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-03-04 16:50:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-03-04 16:50:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-03-04 16:50:20,196 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:50:20,196 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-03-04 16:50:20,196 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:50:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:50:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-03-04 16:50:20,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:50:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:50:20,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:50:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:50:20,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:50:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:50:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:50:23,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:50:23,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:50:23,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:50:23,380 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:50:23,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:50:23,380 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:50:23,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:50:23,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:50:23,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-03-04 16:50:23,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:50:23,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 84 conjunts are in the unsatisfiable core [2019-03-04 16:50:23,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:50:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:50:31,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:50:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:50:39,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:50:39,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2019-03-04 16:50:39,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:50:39,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-03-04 16:50:39,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-03-04 16:50:39,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2019-03-04 16:50:39,850 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states. [2019-03-04 16:51:13,776 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-03-04 16:51:14,522 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-03-04 16:51:15,278 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 16:51:15,988 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-03-04 16:51:16,678 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-03-04 16:51:17,357 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:51:18,039 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:51:18,713 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:51:19,313 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:51:19,915 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:51:20,496 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:51:21,062 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:51:21,612 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144