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_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:37:48,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:37:48,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:37:48,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:37:48,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:37:48,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:37:48,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:37:48,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:37:48,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:37:48,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:37:48,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:37:48,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:37:48,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:37:48,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:37:48,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:37:48,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:37:48,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:37:48,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:37:48,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:37:48,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:37:48,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:37:48,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:37:48,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:37:48,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:37:48,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:37:48,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:37:48,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:37:48,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:37:48,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:37:48,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:37:48,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:37:48,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:37:48,497 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:37:48,497 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:37:48,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:37:48,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:37:48,500 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:37:48,523 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:37:48,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:37:48,524 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:37:48,525 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:37:48,525 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:37:48,525 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:37:48,525 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:37:48,525 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:37:48,526 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:37:48,527 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:37:48,527 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:37:48,527 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:37:48,527 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:37:48,528 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:37:48,528 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:37:48,528 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:37:48,529 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:37:48,532 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:37:48,532 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:37:48,532 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:37:48,533 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:37:48,533 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:37:48,533 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:37:48,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:37:48,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,534 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:37:48,535 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:37:48,535 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:37:48,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:37:48,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:37:48,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:37:48,589 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:37:48,590 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:37:48,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-02-28 10:37:48,590 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-02-28 10:37:48,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:37:48,626 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:37:48,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:37:48,627 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:37:48,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:37:48,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:37:48,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:37:48,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:37:48,683 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:37:48,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:37:48,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:37:48,967 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:37:48,967 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 10:37:48,968 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:48 BoogieIcfgContainer [2019-02-28 10:37:48,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:37:48,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:37:48,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:37:48,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:37:48,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/2) ... [2019-02-28 10:37:48,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72acb0d0 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:37:48, skipping insertion in model container [2019-02-28 10:37:48,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:48" (2/2) ... [2019-02-28 10:37:48,977 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-02-28 10:37:48,988 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:37:48,998 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:37:49,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:37:49,055 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:37:49,056 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:37:49,056 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:37:49,056 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:37:49,056 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:37:49,056 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:37:49,056 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:37:49,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:37:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 10:37:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:37:49,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:37:49,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-28 10:37:49,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:49,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:37:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:37:49,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:37:49,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:37:49,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:37:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:37:49,266 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 10:37:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:49,316 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 10:37:49,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:37:49,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:37:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:49,330 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:37:49,331 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 10:37:49,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-28 10:37:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 10:37:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 10:37:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 10:37:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 10:37:49,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 10:37:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:49,370 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 10:37:49,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:37:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 10:37:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:37:49,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:37:49,371 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-28 10:37:49,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:49,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:49,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:49,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:37:49,519 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-28 10:37:49,595 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:37:49,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:37:50,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:37:50,696 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:37:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:50,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:37:50,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:50,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:37:50,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:50,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:50,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:37:50,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:50,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:50,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:50,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-28 10:37:50,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:50,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:37:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:37:50,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:37:50,939 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-28 10:37:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:50,981 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 10:37:50,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:37:50,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:37:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:50,983 INFO L225 Difference]: With dead ends: 8 [2019-02-28 10:37:50,983 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 10:37:50,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:37:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 10:37:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 10:37:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:37:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 10:37:50,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-28 10:37:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:50,987 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 10:37:50,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:37:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 10:37:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:37:50,988 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:50,988 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:37:50,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-28 10:37:50,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:50,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:51,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:51,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:51,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:37:51,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:51,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:51,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:37:51,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:51,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:37:51,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,222 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:51,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-28 10:37:51,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:51,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:37:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:37:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:37:51,333 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-28 10:37:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:51,406 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 10:37:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:37:51,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:37:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:51,407 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:37:51,407 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:37:51,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:37:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:37:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:37:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:37:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 10:37:51,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-28 10:37:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:51,410 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 10:37:51,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:37:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 10:37:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:37:51,411 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:51,411 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-28 10:37:51,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-28 10:37:51,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:51,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:51,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:51,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:51,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:51,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,515 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-02-28 10:37:51,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:51,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:51,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:51,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:51,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:37:51,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:51,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-28 10:37:51,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:51,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:37:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:37:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:37:51,708 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-28 10:37:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:51,729 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 10:37:51,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:37:51,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-28 10:37:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:51,732 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:37:51,732 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:37:51,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:37:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:37:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:37:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:37:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 10:37:51,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-28 10:37:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:51,735 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 10:37:51,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:37:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 10:37:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:37:51,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:51,736 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-28 10:37:51,736 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-28 10:37:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:51,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:51,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:51,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:51,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:51,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,943 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-02-28 10:37:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:51,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:51,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:37:51,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:52,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:52,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-28 10:37:52,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:52,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:37:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:37:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:37:52,144 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-28 10:37:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:52,171 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 10:37:52,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:37:52,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:37:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:52,173 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:37:52,174 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:37:52,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:37:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:37:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:37:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:37:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-28 10:37:52,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-28 10:37:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:52,177 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-28 10:37:52,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:37:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-28 10:37:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:37:52,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:52,178 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-28 10:37:52,178 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-28 10:37:52,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:52,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:52,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:52,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:52,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:52,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:52,294 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-02-28 10:37:52,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:52,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:52,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:37:52,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:52,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:37:52,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:52,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:52,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:52,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-28 10:37:52,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:52,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:37:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:37:52,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:37:52,945 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-28 10:37:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:52,984 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-28 10:37:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:37:52,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-28 10:37:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:52,985 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:37:52,985 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:37:52,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:37:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:37:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-28 10:37:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:37:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-28 10:37:52,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-28 10:37:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:52,988 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-28 10:37:52,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:37:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 10:37:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:37:52,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:52,989 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-28 10:37:52,989 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-28 10:37:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:53,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:53,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,083 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-02-28 10:37:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:53,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:53,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:53,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:53,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:37:53,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:53,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-28 10:37:53,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:53,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:37:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:37:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:37:53,292 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-28 10:37:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:53,378 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-28 10:37:53,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:37:53,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-28 10:37:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:53,380 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:37:53,380 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:37:53,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:37:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:37:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:37:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:37:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-28 10:37:53,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-28 10:37:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:53,384 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-28 10:37:53,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:37:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 10:37:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:37:53,385 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:53,385 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-28 10:37:53,385 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:53,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:53,386 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-28 10:37:53,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:53,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:53,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:53,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:53,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:53,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,546 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-02-28 10:37:53,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:53,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:53,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:37:53,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-28 10:37:53,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:53,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:37:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:37:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:37:53,841 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-28 10:37:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:53,867 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-28 10:37:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:37:53,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-28 10:37:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:53,869 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:37:53,869 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:37:53,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:37:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:37:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:37:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:37:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-28 10:37:53,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-28 10:37:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:53,873 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-28 10:37:53,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:37:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-28 10:37:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:37:53,873 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:53,873 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-28 10:37:53,874 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-28 10:37:53,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:53,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:53,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:53,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,991 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-02-28 10:37:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:54,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:54,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-28 10:37:54,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:54,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:37:54,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,030 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:54,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-28 10:37:54,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:54,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:37:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:37:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:37:54,243 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-28 10:37:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:54,272 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-28 10:37:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:37:54,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-28 10:37:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:54,273 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:37:54,273 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:37:54,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:37:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:37:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:37:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:37:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-28 10:37:54,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-28 10:37:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:54,276 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-28 10:37:54,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:37:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-28 10:37:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:37:54,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:54,277 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-28 10:37:54,277 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-28 10:37:54,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:54,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:54,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:54,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:54,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:54,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,389 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-02-28 10:37:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:54,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:54,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:54,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:54,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:37:54,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:54,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-28 10:37:54,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:54,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:37:54,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:37:54,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:37:54,605 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-28 10:37:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:54,631 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-28 10:37:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:37:54,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-28 10:37:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:54,633 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:37:54,633 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:37:54,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:37:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:37:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-28 10:37:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:37:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-28 10:37:54,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-28 10:37:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:54,637 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-28 10:37:54,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:37:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-28 10:37:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-28 10:37:54,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:54,638 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-28 10:37:54,638 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-28 10:37:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:54,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:54,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:54,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:54,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,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 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-02-28 10:37:54,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:54,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:37:54,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-28 10:37:55,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:55,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:37:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:37:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:37:55,076 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-28 10:37:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:55,114 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-28 10:37:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:37:55,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-28 10:37:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:55,115 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:37:55,115 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:37:55,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:37:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:37:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-28 10:37:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:37:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-28 10:37:55,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-28 10:37:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:55,120 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-28 10:37:55,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:37:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-28 10:37:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-28 10:37:55,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:55,121 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-28 10:37:55,121 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-28 10:37:55,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:55,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:55,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:55,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:55,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,489 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-02-28 10:37:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:55,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:55,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-28 10:37:55,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:55,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:37:55,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:55,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:55,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:55,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-28 10:37:55,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:55,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:37:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:37:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:37:55,757 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-28 10:37:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:55,809 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-28 10:37:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:37:55,810 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-28 10:37:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:55,810 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:37:55,810 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:37:55,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:37:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:37:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-28 10:37:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:37:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-28 10:37:55,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-28 10:37:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:55,814 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-28 10:37:55,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:37:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-28 10:37:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:37:55,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:55,815 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-28 10:37:55,815 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-28 10:37:55,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:55,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:55,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:55,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:55,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,966 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-02-28 10:37:55,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:55,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:56,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:56,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:56,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:37:56,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:56,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:56,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:56,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-28 10:37:56,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:56,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:37:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:37:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:37:56,495 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-28 10:37:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:56,525 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-28 10:37:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:37:56,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-28 10:37:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:56,536 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:37:56,536 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:37:56,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:37:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:37:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:37:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:37:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-28 10:37:56,540 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-28 10:37:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:56,540 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-28 10:37:56,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:37:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-28 10:37:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:37:56,541 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:56,541 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-28 10:37:56,541 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-28 10:37:56,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:56,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:56,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:56,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:56,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:56,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:56,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:56,766 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-02-28 10:37:56,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:56,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:56,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:37:56,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:56,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:57,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:57,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-28 10:37:57,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:57,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:37:57,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:37:57,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:37:57,178 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-28 10:37:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:57,210 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-28 10:37:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:37:57,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-28 10:37:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:57,214 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:37:57,214 INFO L226 Difference]: Without dead ends: 18 [2019-02-28 10:37:57,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:37:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-28 10:37:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-28 10:37:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:37:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-28 10:37:57,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-28 10:37:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:57,217 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-28 10:37:57,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:37:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-28 10:37:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-28 10:37:57,218 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:57,218 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-28 10:37:57,218 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:57,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-28 10:37:57,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:57,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:57,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:57,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:57,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:57,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:57,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:57,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:57,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:37:57,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:57,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:57,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:37:57,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:57,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:37:57,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:57,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:58,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:58,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-28 10:37:58,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:58,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:37:58,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:37:58,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:37:58,042 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-28 10:37:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:58,077 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-28 10:37:58,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:37:58,078 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-28 10:37:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:58,078 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:37:58,078 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:37:58,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:37:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:37:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:37:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:37:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-28 10:37:58,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-28 10:37:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:58,083 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-28 10:37:58,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:37:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-28 10:37:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 10:37:58,083 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:58,084 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-28 10:37:58,084 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-28 10:37:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:58,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:58,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:58,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:58,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:58,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:58,364 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-02-28 10:37:58,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:58,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:58,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:58,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:58,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 10:37:58,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:58,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:58,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-28 10:37:58,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:58,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:37:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:37:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:37:58,924 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-28 10:37:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:58,967 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-28 10:37:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:37:58,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-28 10:37:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:58,969 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:37:58,969 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:37:58,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:37:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:37:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-28 10:37:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:37:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-28 10:37:58,973 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-28 10:37:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:58,974 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-28 10:37:58,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:37:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-28 10:37:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-28 10:37:58,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:58,975 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-28 10:37:58,975 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-28 10:37:58,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:59,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:59,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:59,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:59,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,525 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-02-28 10:37:59,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:59,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:59,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:37:59,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:59,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:00,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:00,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-28 10:38:00,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:00,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:38:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:38:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:38:00,166 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-28 10:38:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:00,190 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-28 10:38:00,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:38:00,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-28 10:38:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:00,192 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:38:00,192 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:38:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:38:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:38:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:38:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:38:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-28 10:38:00,196 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-28 10:38:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:00,196 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-28 10:38:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:38:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-28 10:38:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:38:00,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:00,197 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-28 10:38:00,197 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:00,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-28 10:38:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:00,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:00,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:00,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:00,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:00,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:00,413 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-02-28 10:38:00,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:00,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:00,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-28 10:38:00,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:00,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:38:00,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:00,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:01,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:01,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-28 10:38:01,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:01,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:38:01,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:38:01,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:38:01,204 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-28 10:38:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:01,229 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-28 10:38:01,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:38:01,230 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-28 10:38:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:01,230 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:38:01,230 INFO L226 Difference]: Without dead ends: 22 [2019-02-28 10:38:01,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:38:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-28 10:38:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-28 10:38:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:38:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-28 10:38:01,236 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-28 10:38:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:01,236 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-28 10:38:01,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:38:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-28 10:38:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-28 10:38:01,237 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:01,237 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-28 10:38:01,237 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:01,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-28 10:38:01,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:01,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:01,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:01,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:01,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,962 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-02-28 10:38:01,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:01,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:02,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:02,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:02,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:38:02,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:02,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:02,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:02,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-28 10:38:02,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:02,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:38:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:38:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:38:02,472 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-28 10:38:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:02,507 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-28 10:38:02,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:38:02,508 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-28 10:38:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:02,509 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:38:02,509 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:38:02,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:38:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:38:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-28 10:38:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:38:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-28 10:38:02,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-28 10:38:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:02,515 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-28 10:38:02,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:38:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-28 10:38:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 10:38:02,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:02,516 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-28 10:38:02,518 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-28 10:38:02,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:02,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:02,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:03,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:03,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:03,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:03,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,134 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-02-28 10:38:03,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:03,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:03,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 10:38:03,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:03,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:03,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:03,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-28 10:38:03,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:03,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:38:03,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:38:03,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:38:03,730 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-28 10:38:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:03,772 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-28 10:38:03,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:38:03,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-28 10:38:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:03,776 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:38:03,776 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:38:03,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:38:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:38:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-28 10:38:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:38:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-28 10:38:03,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-28 10:38:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:03,780 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-28 10:38:03,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:38:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-28 10:38:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:38:03,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:03,780 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-28 10:38:03,781 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-28 10:38:03,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:03,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:03,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:04,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:04,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:04,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:04,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,497 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-02-28 10:38:04,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:04,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:04,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:38:04,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:04,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:38:04,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:04,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:05,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:05,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-28 10:38:05,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:05,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:38:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:38:05,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:38:05,178 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-28 10:38:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:05,231 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-28 10:38:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:38:05,231 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-28 10:38:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:05,232 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:38:05,232 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:38:05,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:38:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:38:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-28 10:38:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:38:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-28 10:38:05,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-28 10:38:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:05,237 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-28 10:38:05,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:38:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-28 10:38:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:38:05,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:05,238 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-28 10:38:05,238 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-28 10:38:05,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:05,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:05,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:05,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:05,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:05,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:05,573 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-02-28 10:38:05,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:05,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:05,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:05,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:05,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:38:05,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:05,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:06,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:06,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-28 10:38:06,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:06,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:38:06,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:38:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:06,186 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-28 10:38:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:06,282 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-28 10:38:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:38:06,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-28 10:38:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:06,285 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:38:06,285 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 10:38:06,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 10:38:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-28 10:38:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:38:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-28 10:38:06,289 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-28 10:38:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:06,289 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-28 10:38:06,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:38:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-28 10:38:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-28 10:38:06,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:06,290 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-28 10:38:06,290 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-28 10:38:06,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:06,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:06,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:06,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:06,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:07,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:07,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:07,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:07,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:07,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:07,310 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-02-28 10:38:07,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:07,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:07,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-28 10:38:07,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:07,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:08,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:08,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-28 10:38:08,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:08,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:38:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:38:08,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:38:08,087 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-28 10:38:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:08,121 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-28 10:38:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:38:08,123 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-28 10:38:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:08,124 INFO L225 Difference]: With dead ends: 29 [2019-02-28 10:38:08,124 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:38:08,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:38:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:38:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-28 10:38:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:38:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-28 10:38:08,128 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-28 10:38:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:08,129 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-28 10:38:08,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:38:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-28 10:38:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:38:08,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:08,130 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-28 10:38:08,130 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-28 10:38:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:08,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:08,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:08,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:08,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:08,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:08,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:08,495 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-02-28 10:38:08,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:08,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:08,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:38:08,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:08,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:38:08,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:08,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:09,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:09,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-28 10:38:09,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:09,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:38:09,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:38:09,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:38:09,559 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-28 10:38:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:09,613 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-28 10:38:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:38:09,614 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-28 10:38:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:09,614 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:38:09,614 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:38:09,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:38:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:38:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-28 10:38:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:38:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-28 10:38:09,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-28 10:38:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:09,620 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-28 10:38:09,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:38:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-28 10:38:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:38:09,620 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:09,621 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-28 10:38:09,621 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-28 10:38:09,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:09,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:09,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:10,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:10,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:10,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:10,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:10,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:10,033 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-02-28 10:38:10,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:10,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:10,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:10,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:10,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:38:10,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:10,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:10,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:10,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-28 10:38:10,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:10,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:38:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:38:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:38:10,781 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-28 10:38:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:10,831 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-28 10:38:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:38:10,831 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-28 10:38:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:10,832 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:38:10,832 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:38:10,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:38:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:38:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-28 10:38:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:38:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-28 10:38:10,837 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-28 10:38:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:10,837 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-28 10:38:10,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:38:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-28 10:38:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:38:10,838 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:10,838 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-28 10:38:10,838 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-28 10:38:10,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:10,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:10,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:11,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:11,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:11,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:11,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:11,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:11,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:38:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:11,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:11,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:38:11,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:11,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:12,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:12,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-28 10:38:12,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:12,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:38:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:38:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:38:12,728 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-28 10:38:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:12,785 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-28 10:38:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:38:12,785 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-28 10:38:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:12,786 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:38:12,786 INFO L226 Difference]: Without dead ends: 30 [2019-02-28 10:38:12,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:38:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-28 10:38:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-28 10:38:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:38:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-28 10:38:12,791 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-28 10:38:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:12,791 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-28 10:38:12,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:38:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-28 10:38:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-28 10:38:12,791 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:12,792 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-28 10:38:12,792 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-28 10:38:12,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:12,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:12,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:13,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:13,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:13,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:13,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:13,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:13,443 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-02-28 10:38:13,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:13,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:13,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-28 10:38:13,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:13,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:38:13,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:13,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:14,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:14,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-28 10:38:14,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:14,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:38:14,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:38:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:38:14,354 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-28 10:38:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:14,593 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-28 10:38:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:38:14,594 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-28 10:38:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:14,595 INFO L225 Difference]: With dead ends: 33 [2019-02-28 10:38:14,595 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:38:14,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:38:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:38:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:38:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:38:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-28 10:38:14,600 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-28 10:38:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:14,600 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-28 10:38:14,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:38:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-28 10:38:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:38:14,601 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:14,601 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-28 10:38:14,602 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-28 10:38:14,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:14,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:14,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:15,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:15,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:15,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:15,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:15,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:15,031 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-02-28 10:38:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:15,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:15,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:15,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:15,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:38:15,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:15,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:15,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:15,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-28 10:38:15,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:38:15,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:38:15,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:38:15,988 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-28 10:38:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:16,021 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-28 10:38:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:38:16,021 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-28 10:38:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:16,022 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:38:16,022 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 10:38:16,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:38:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 10:38:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-28 10:38:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:38:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-28 10:38:16,027 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-28 10:38:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:16,027 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-28 10:38:16,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:38:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-28 10:38:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:38:16,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:16,028 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-28 10:38:16,028 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:16,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-28 10:38:16,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:16,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:16,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:16,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:16,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:16,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:16,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 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-02-28 10:38:16,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:16,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:16,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:38:16,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:16,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:17,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:17,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-28 10:38:17,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:17,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:38:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:38:17,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:38:17,452 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-28 10:38:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:17,535 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-28 10:38:17,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:38:17,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-28 10:38:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:17,536 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:38:17,536 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:38:17,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:38:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:38:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-28 10:38:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:38:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-28 10:38:17,541 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-28 10:38:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:17,541 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-28 10:38:17,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:38:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-28 10:38:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:38:17,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:17,542 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-28 10:38:17,542 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-28 10:38:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:17,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:18,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:18,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:18,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:18,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:18,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:18,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:38:18,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:18,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:18,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:38:18,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:18,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:38:18,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:18,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:19,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:19,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-28 10:38:19,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:19,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:38:19,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:38:19,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:38:19,348 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-28 10:38:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:19,428 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-28 10:38:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:38:19,429 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-28 10:38:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:19,430 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:38:19,430 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:38:19,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:38:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:38:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-28 10:38:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:38:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-28 10:38:19,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-28 10:38:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:19,433 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-28 10:38:19,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:38:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-28 10:38:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-28 10:38:19,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:19,433 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-28 10:38:19,434 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:19,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-28 10:38:19,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:19,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:19,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:19,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:19,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:19,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:19,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:19,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:19,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:19,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:19,828 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-02-28 10:38:19,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:19,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:19,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:19,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:19,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-28 10:38:19,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:19,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:20,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:20,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-28 10:38:20,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:20,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:38:20,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:38:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:38:20,949 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-28 10:38:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:21,025 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-28 10:38:21,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:38:21,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-28 10:38:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:21,026 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:38:21,026 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:38:21,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:38:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:38:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-28 10:38:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:38:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-28 10:38:21,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-28 10:38:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:21,030 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-28 10:38:21,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:38:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-28 10:38:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:38:21,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:21,031 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-28 10:38:21,031 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-28 10:38:21,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:21,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:21,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:21,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:21,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:21,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:21,484 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-02-28 10:38:21,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:21,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:21,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-28 10:38:21,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:21,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:22,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:22,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-28 10:38:22,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:22,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:38:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:38:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:38:22,781 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-28 10:38:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:22,848 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-28 10:38:22,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:38:22,849 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-28 10:38:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:22,850 INFO L225 Difference]: With dead ends: 38 [2019-02-28 10:38:22,850 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:38:22,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:38:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:38:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-28 10:38:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:38:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-28 10:38:22,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-28 10:38:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:22,854 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-28 10:38:22,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:38:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-28 10:38:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:38:22,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:22,854 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-28 10:38:22,855 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:22,857 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-28 10:38:22,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:22,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:22,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:23,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:23,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:23,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:23,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,646 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-02-28 10:38:23,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:23,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:23,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-28 10:38:23,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:23,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:38:23,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:23,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:24,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:24,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-28 10:38:24,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:24,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:38:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:38:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:38:24,984 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-28 10:38:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:25,048 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-28 10:38:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:38:25,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-28 10:38:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:25,049 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:38:25,049 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:38:25,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:38:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:38:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-28 10:38:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:38:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-28 10:38:25,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-28 10:38:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:25,054 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-28 10:38:25,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:38:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-28 10:38:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:38:25,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:25,055 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-28 10:38:25,055 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-28 10:38:25,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:25,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:25,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:25,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:25,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:25,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:25,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:25,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:25,585 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-02-28 10:38:25,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:25,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:25,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:25,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:25,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:38:25,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:25,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:26,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:26,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-28 10:38:26,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:26,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:38:26,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:38:26,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:26,884 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-28 10:38:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:26,983 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-28 10:38:26,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:38:26,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-28 10:38:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:26,985 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:38:26,985 INFO L226 Difference]: Without dead ends: 38 [2019-02-28 10:38:26,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-28 10:38:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-28 10:38:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:38:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-28 10:38:26,987 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-28 10:38:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:26,987 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-28 10:38:26,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:38:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-28 10:38:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-28 10:38:26,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:26,988 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-28 10:38:26,988 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:26,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:26,988 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-28 10:38:26,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:26,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:26,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:27,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:27,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:27,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:27,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:27,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:27,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:38:27,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:27,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:27,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-28 10:38:27,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:27,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:29,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:29,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-28 10:38:29,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:29,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:38:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:38:29,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:38:29,514 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-28 10:38:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:29,580 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-28 10:38:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:38:29,580 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-28 10:38:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:29,581 INFO L225 Difference]: With dead ends: 41 [2019-02-28 10:38:29,581 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:38:29,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:38:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:38:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-28 10:38:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:38:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-28 10:38:29,585 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-28 10:38:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:29,585 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-28 10:38:29,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:38:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-28 10:38:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-28 10:38:29,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:29,586 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-28 10:38:29,586 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-28 10:38:29,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:29,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:29,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:30,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:30,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:30,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:30,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:30,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:30,252 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-02-28 10:38:30,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:30,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:30,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-28 10:38:30,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:30,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:38:30,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:30,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:31,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:31,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-28 10:38:31,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:31,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:38:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:38:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:38:31,783 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-28 10:38:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:31,835 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-28 10:38:31,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:38:31,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-28 10:38:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:31,836 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:38:31,836 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:38:31,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:38:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:38:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-28 10:38:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:38:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-28 10:38:31,840 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-28 10:38:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:31,840 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-28 10:38:31,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:38:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-28 10:38:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-28 10:38:31,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:31,841 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-28 10:38:31,841 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-28 10:38:31,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:31,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:31,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:32,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:32,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:32,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:32,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:32,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:32,981 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-02-28 10:38:32,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:32,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:33,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:33,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:33,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:38:33,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:33,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:34,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:34,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-28 10:38:34,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:34,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:38:34,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:38:34,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:38:34,850 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-28 10:38:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:34,905 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-28 10:38:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:38:34,906 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-28 10:38:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:34,907 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:38:34,907 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:38:34,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:38:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:38:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-28 10:38:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:38:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-28 10:38:34,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-28 10:38:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:34,910 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-28 10:38:34,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:38:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-28 10:38:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:38:34,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:34,911 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-28 10:38:34,911 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-28 10:38:34,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:34,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:34,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:35,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:35,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:35,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:35,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:35,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:35,505 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-02-28 10:38:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:35,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:35,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:38:35,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:35,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:37,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:37,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-28 10:38:37,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:37,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:38:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:38:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:38:37,101 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-28 10:38:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:37,186 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-28 10:38:37,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:38:37,186 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-28 10:38:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:37,187 INFO L225 Difference]: With dead ends: 44 [2019-02-28 10:38:37,187 INFO L226 Difference]: Without dead ends: 42 [2019-02-28 10:38:37,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:38:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-28 10:38:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-28 10:38:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-28 10:38:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-28 10:38:37,189 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-28 10:38:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:37,189 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-28 10:38:37,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:38:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-28 10:38:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-28 10:38:37,190 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:37,190 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-28 10:38:37,191 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-28 10:38:37,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:37,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:37,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:37,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:37,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:38,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:38,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:38,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:38,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:38,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:38,406 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-02-28 10:38:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:38,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:38,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:38:38,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:38,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:38:38,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:38,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:40,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:40,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-28 10:38:40,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:40,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:38:40,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:38:40,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:38:40,395 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-28 10:38:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:40,460 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-28 10:38:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:38:40,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-28 10:38:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:40,461 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:38:40,461 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:38:40,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:38:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:38:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-28 10:38:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-28 10:38:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-28 10:38:40,465 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-28 10:38:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:40,465 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-28 10:38:40,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:38:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-28 10:38:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-28 10:38:40,466 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:40,466 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-28 10:38:40,466 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:40,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-28 10:38:40,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:40,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:40,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:41,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:41,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:41,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:41,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:41,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:41,173 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-02-28 10:38:41,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:41,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:41,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:41,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:41,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-28 10:38:41,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:41,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:42,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:42,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-28 10:38:42,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:42,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:38:42,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:38:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:38:42,927 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-28 10:38:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:42,995 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-28 10:38:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:38:42,996 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-28 10:38:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:42,996 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:38:42,996 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:38:42,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:38:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:38:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-28 10:38:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-28 10:38:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-28 10:38:42,998 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-28 10:38:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:42,999 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-28 10:38:42,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:38:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-28 10:38:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-28 10:38:42,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:42,999 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-28 10:38:42,999 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-28 10:38:43,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:43,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:43,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:43,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:43,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:43,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:43,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:43,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:43,920 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-02-28 10:38:43,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:43,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:43,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:38:43,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:43,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:45,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:45,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-28 10:38:45,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:45,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:38:45,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:38:45,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:38:45,774 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-28 10:38:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:45,861 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-28 10:38:45,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:38:45,862 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-28 10:38:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:45,863 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:38:45,863 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:38:45,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:38:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:38:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-28 10:38:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:38:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-28 10:38:45,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-28 10:38:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:45,865 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-28 10:38:45,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:38:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-28 10:38:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:38:45,866 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:45,866 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-28 10:38:45,866 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-28 10:38:45,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:45,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:45,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:46,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:46,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:46,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:46,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:46,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:46,766 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-02-28 10:38:46,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:46,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:46,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:38:46,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:46,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:38:46,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:46,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:49,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:49,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-28 10:38:49,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:49,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:38:49,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:38:49,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:38:49,259 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-28 10:38:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:49,332 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-28 10:38:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:38:49,333 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-28 10:38:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:49,333 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:38:49,333 INFO L226 Difference]: Without dead ends: 46 [2019-02-28 10:38:49,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:38:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-28 10:38:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-28 10:38:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:38:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-28 10:38:49,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-28 10:38:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:49,336 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-28 10:38:49,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:38:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-28 10:38:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-28 10:38:49,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:49,336 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-28 10:38:49,336 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-28 10:38:49,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:49,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:49,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:49,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:50,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:50,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:50,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:50,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:50,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:50,071 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-02-28 10:38:50,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:50,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:50,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:50,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:50,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:38:50,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:50,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-28 10:38:52,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:52,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:38:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:38:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:38:52,117 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-28 10:38:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:52,170 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-28 10:38:52,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:38:52,171 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-28 10:38:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:52,171 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:38:52,172 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:38:52,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:38:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:38:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-28 10:38:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:38:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-28 10:38:52,175 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-28 10:38:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:52,176 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-28 10:38:52,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:38:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-28 10:38:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:38:52,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:52,176 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-28 10:38:52,176 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-28 10:38:52,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:52,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:52,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:53,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:53,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:53,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:53,084 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-02-28 10:38:53,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:53,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:53,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-28 10:38:53,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:53,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:55,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:55,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-28 10:38:55,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:55,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:38:55,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:38:55,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:38:55,411 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-28 10:38:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:55,504 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-28 10:38:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:38:55,505 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-28 10:38:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:55,506 INFO L225 Difference]: With dead ends: 50 [2019-02-28 10:38:55,506 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 10:38:55,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:38:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 10:38:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-28 10:38:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:38:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-28 10:38:55,509 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-28 10:38:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:55,510 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-28 10:38:55,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:38:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-28 10:38:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-28 10:38:55,510 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:55,510 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-28 10:38:55,511 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-28 10:38:55,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:55,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:55,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:56,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:56,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:56,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:56,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:56,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:56,381 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-02-28 10:38:56,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:56,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:56,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-28 10:38:56,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:56,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:38:56,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:56,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:58,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:58,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-28 10:38:58,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:58,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:38:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:38:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:38:58,678 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-28 10:38:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:58,752 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-28 10:38:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:38:58,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-28 10:38:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:58,754 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:38:58,754 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:38:58,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:38:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:38:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-28 10:38:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:38:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-28 10:38:58,758 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-28 10:38:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:58,758 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-28 10:38:58,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:38:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-28 10:38:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:38:58,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:58,759 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-28 10:38:58,759 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-28 10:38:58,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:58,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:58,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:59,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:59,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:59,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:59,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,835 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-02-28 10:38:59,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:59,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:59,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:59,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:59,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:38:59,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:59,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:02,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:02,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-28 10:39:02,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:02,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:39:02,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:39:02,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:02,107 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-28 10:39:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:02,331 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-28 10:39:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:39:02,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-28 10:39:02,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:02,332 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:39:02,333 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:39:02,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:39:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-28 10:39:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:39:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-28 10:39:02,336 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-28 10:39:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:02,336 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-28 10:39:02,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:39:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-28 10:39:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-28 10:39:02,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:02,337 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-28 10:39:02,337 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-28 10:39:02,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:02,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:02,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:02,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:02,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:03,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:03,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:03,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:03,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:03,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:03,263 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-02-28 10:39:03,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:03,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:03,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:39:03,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:03,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:05,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:05,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-28 10:39:05,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:05,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:39:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:39:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:39:05,908 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-28 10:39:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:06,001 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-28 10:39:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:39:06,001 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-28 10:39:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:06,002 INFO L225 Difference]: With dead ends: 53 [2019-02-28 10:39:06,002 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:39:06,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:39:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:39:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-28 10:39:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:39:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-28 10:39:06,005 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-28 10:39:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:06,005 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-28 10:39:06,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:39:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-28 10:39:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:39:06,006 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:06,006 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-28 10:39:06,006 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-28 10:39:06,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:06,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:06,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:06,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:06,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:06,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:06,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:06,997 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-02-28 10:39:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:07,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:07,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:39:07,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:07,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:39:07,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:07,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:10,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:10,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-28 10:39:10,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:10,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:39:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:39:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:39:10,153 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-28 10:39:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:10,216 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-28 10:39:10,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:39:10,217 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-28 10:39:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:10,218 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:39:10,218 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:39:10,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:39:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:39:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-28 10:39:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:39:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-28 10:39:10,221 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-28 10:39:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:10,221 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-28 10:39:10,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:39:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-28 10:39:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:39:10,222 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:10,222 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-28 10:39:10,222 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-28 10:39:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:10,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:10,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:11,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:11,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:11,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:11,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:11,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:11,263 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-02-28 10:39:11,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:11,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:11,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:11,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:11,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:39:11,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:11,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:13,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:13,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-28 10:39:13,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:13,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:39:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:39:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:39:13,796 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-28 10:39:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:13,874 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-28 10:39:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:39:13,874 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-28 10:39:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:13,875 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:39:13,875 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:39:13,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:39:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:39:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-28 10:39:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:39:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-28 10:39:13,878 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-28 10:39:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:13,879 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-28 10:39:13,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:39:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-28 10:39:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:39:13,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:13,879 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-28 10:39:13,879 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-28 10:39:13,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:13,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:13,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:15,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:15,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:15,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:15,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:15,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:15,191 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-02-28 10:39:15,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:15,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:15,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-28 10:39:15,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:15,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:17,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:17,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-28 10:39:17,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:17,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:39:17,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:39:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:39:17,911 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-28 10:39:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:17,974 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-28 10:39:17,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:39:17,974 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-28 10:39:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:17,975 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:39:17,975 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:39:17,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:39:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:39:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-28 10:39:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:39:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-28 10:39:17,978 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-28 10:39:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:17,979 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-28 10:39:17,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:39:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-28 10:39:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-28 10:39:17,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:17,979 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-28 10:39:17,979 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:17,980 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-28 10:39:17,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:17,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:17,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:17,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:18,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:18,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:18,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:18,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:19,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:19,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:39:19,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:19,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:19,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-28 10:39:19,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:19,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:39:19,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:19,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:22,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:22,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-28 10:39:22,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:22,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:39:22,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:39:22,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:39:22,229 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-28 10:39:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:22,330 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-28 10:39:22,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:39:22,331 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-28 10:39:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:22,331 INFO L225 Difference]: With dead ends: 57 [2019-02-28 10:39:22,332 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:39:22,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:39:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:39:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-28 10:39:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:39:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-28 10:39:22,335 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-28 10:39:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:22,335 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-28 10:39:22,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:39:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-28 10:39:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-28 10:39:22,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:22,336 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-28 10:39:22,336 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-28 10:39:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:22,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:22,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:23,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:23,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:23,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:23,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:23,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:23,473 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-02-28 10:39:23,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:23,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:23,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:23,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:23,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-28 10:39:23,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:23,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:26,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:26,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-28 10:39:26,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:26,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:39:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:39:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:39:26,695 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-28 10:39:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:26,803 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-28 10:39:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:39:26,804 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-28 10:39:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:26,805 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:39:26,805 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:39:26,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:39:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:39:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-28 10:39:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:39:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-28 10:39:26,808 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-28 10:39:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:26,808 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-28 10:39:26,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:39:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-28 10:39:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:39:26,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:26,809 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-28 10:39:26,810 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-28 10:39:26,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:26,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:26,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:27,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:27,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:27,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:27,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:27,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:27,887 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-02-28 10:39:27,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:27,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:27,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:39:27,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:27,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:31,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-28 10:39:31,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:31,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:39:31,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:39:31,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:39:31,172 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-28 10:39:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:31,270 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-28 10:39:31,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:39:31,270 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-28 10:39:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:31,271 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:39:31,271 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:39:31,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:39:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:39:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-28 10:39:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:39:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-28 10:39:31,274 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-28 10:39:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:31,275 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-28 10:39:31,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:39:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-28 10:39:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:39:31,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:31,275 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-28 10:39:31,275 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-28 10:39:31,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:31,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:31,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:31,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:31,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:32,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:32,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:32,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:32,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:32,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:32,352 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-02-28 10:39:32,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:32,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:32,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-28 10:39:32,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:32,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:39:32,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:32,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-28 10:39:36,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:36,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:39:36,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:39:36,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:39:36,046 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-28 10:39:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:36,119 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-28 10:39:36,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:39:36,119 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-28 10:39:36,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:36,120 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:39:36,120 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:39:36,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:39:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:39:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-28 10:39:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-28 10:39:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-28 10:39:36,123 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-28 10:39:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:36,123 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-28 10:39:36,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:39:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-28 10:39:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-28 10:39:36,123 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:36,123 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-28 10:39:36,124 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:36,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-28 10:39:36,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:36,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:36,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:36,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:37,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:37,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:37,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:37,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:37,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:37,262 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-02-28 10:39:37,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:37,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:37,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:37,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:37,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:39:37,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:37,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:40,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:40,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-28 10:39:40,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:39:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:39:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:39:40,672 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-28 10:39:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:40,775 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-28 10:39:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:39:40,776 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-28 10:39:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:40,776 INFO L225 Difference]: With dead ends: 61 [2019-02-28 10:39:40,776 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:39:40,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:39:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:39:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-28 10:39:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:39:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-28 10:39:40,779 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-28 10:39:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:40,779 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-28 10:39:40,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:39:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-28 10:39:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:39:40,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:40,780 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-28 10:39:40,780 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-28 10:39:40,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:40,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:40,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:40,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:40,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:46,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:46,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:46,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:46,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:46,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:46,647 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-02-28 10:39:46,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:46,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:46,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-28 10:39:46,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:46,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:49,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:49,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-28 10:39:49,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:49,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:39:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:39:49,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:39:49,918 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-28 10:39:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:50,031 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-28 10:39:50,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:39:50,031 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-28 10:39:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:50,032 INFO L225 Difference]: With dead ends: 62 [2019-02-28 10:39:50,032 INFO L226 Difference]: Without dead ends: 60 [2019-02-28 10:39:50,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:39:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-28 10:39:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-28 10:39:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-28 10:39:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-28 10:39:50,036 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-28 10:39:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:50,036 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-28 10:39:50,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:39:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-28 10:39:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-28 10:39:50,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:50,037 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-28 10:39:50,037 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-28 10:39:50,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:50,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:50,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:50,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:50,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:51,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:51,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:51,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:51,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:51,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:51,825 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-02-28 10:39:51,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:51,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:52,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-28 10:39:52,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:52,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:39:52,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:52,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:55,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:55,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-28 10:39:55,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:55,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:39:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:39:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:39:55,727 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-28 10:39:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:55,803 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-28 10:39:55,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:39:55,803 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-28 10:39:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:55,804 INFO L225 Difference]: With dead ends: 63 [2019-02-28 10:39:55,804 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:39:55,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:39:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:39:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-28 10:39:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:39:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-28 10:39:55,808 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-28 10:39:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:55,809 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-28 10:39:55,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:39:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-28 10:39:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:39:55,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:55,809 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-28 10:39:55,810 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:55,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:55,810 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-28 10:39:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:55,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:55,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:57,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:57,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:57,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:57,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:57,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:57,437 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-02-28 10:39:57,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:57,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:57,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:57,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:57,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:39:57,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:57,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:01,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:01,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-28 10:40:01,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:01,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:40:01,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:40:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:01,973 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-28 10:40:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:02,082 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-28 10:40:02,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:40:02,082 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-28 10:40:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:02,083 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:40:02,083 INFO L226 Difference]: Without dead ends: 62 [2019-02-28 10:40:02,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:02,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-28 10:40:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-28 10:40:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-28 10:40:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-28 10:40:02,087 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-28 10:40:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:02,088 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-28 10:40:02,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:40:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-28 10:40:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-28 10:40:02,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:02,088 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-28 10:40:02,089 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-28 10:40:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:02,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:02,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:04,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:04,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:04,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:04,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:04,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:04,050 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-02-28 10:40:04,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:04,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:04,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-28 10:40:04,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:04,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:08,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:08,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-28 10:40:08,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:08,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-28 10:40:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-28 10:40:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:40:08,025 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-28 10:40:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:08,123 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-28 10:40:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:40:08,123 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-28 10:40:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:08,124 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:40:08,124 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:40:08,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:40:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:40:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-28 10:40:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:40:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-28 10:40:08,127 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-28 10:40:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:08,128 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-28 10:40:08,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-28 10:40:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-28 10:40:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:40:08,128 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:08,128 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-28 10:40:08,129 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-28 10:40:08,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:08,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:08,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:08,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:09,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:09,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:09,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:09,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:09,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:09,718 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-02-28 10:40:09,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:09,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:10,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-28 10:40:10,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:10,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:40:10,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:10,080 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:14,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:14,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-28 10:40:14,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:14,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:40:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:40:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:40:14,189 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-28 10:40:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:14,272 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-28 10:40:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:40:14,272 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-28 10:40:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:14,273 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:40:14,273 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:40:14,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:40:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:40:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-28 10:40:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-28 10:40:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-28 10:40:14,277 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-28 10:40:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:14,277 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-28 10:40:14,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:40:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-28 10:40:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-28 10:40:14,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:14,278 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-28 10:40:14,278 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-28 10:40:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:14,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:14,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:14,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:15,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:15,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:15,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:15,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:15,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:15,608 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-02-28 10:40:15,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:15,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:15,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:15,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:15,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:40:15,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:15,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:19,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:19,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-28 10:40:19,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:19,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-28 10:40:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-28 10:40:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:40:19,776 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-28 10:40:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:19,913 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-28 10:40:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:40:19,914 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-28 10:40:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:19,914 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:40:19,914 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:40:19,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:40:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:40:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-28 10:40:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:40:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-28 10:40:19,917 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-28 10:40:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:19,917 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-28 10:40:19,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-28 10:40:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-28 10:40:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:40:19,917 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:19,917 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-28 10:40:19,918 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:19,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-28 10:40:19,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:19,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:19,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:21,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:21,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:21,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:21,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:21,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:21,852 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-02-28 10:40:21,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:21,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:21,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:40:21,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:21,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:25,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:25,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-28 10:40:25,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:25,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:40:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:40:25,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:40:25,999 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-28 10:40:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:26,235 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-28 10:40:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:40:26,235 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-28 10:40:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:26,236 INFO L225 Difference]: With dead ends: 68 [2019-02-28 10:40:26,236 INFO L226 Difference]: Without dead ends: 66 [2019-02-28 10:40:26,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:40:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-28 10:40:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-28 10:40:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:40:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-28 10:40:26,238 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-28 10:40:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:26,238 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-28 10:40:26,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:40:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-28 10:40:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:40:26,239 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:26,239 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-28 10:40:26,239 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-28 10:40:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:26,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:27,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:27,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:27,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:27,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:27,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:27,735 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-02-28 10:40:27,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:27,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:28,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-28 10:40:28,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:28,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:40:28,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:28,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:32,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:32,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-28 10:40:32,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:32,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:40:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:40:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:40:32,401 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-28 10:40:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:32,518 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-28 10:40:32,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:40:32,519 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-28 10:40:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:32,519 INFO L225 Difference]: With dead ends: 69 [2019-02-28 10:40:32,519 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:40:32,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:40:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:40:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-28 10:40:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:40:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-28 10:40:32,523 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-28 10:40:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:32,523 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-28 10:40:32,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:40:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-28 10:40:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:40:32,524 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:32,524 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-28 10:40:32,524 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-28 10:40:32,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:32,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:32,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:34,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:34,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:34,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:34,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:34,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:34,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:40:34,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:34,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:34,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:34,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:34,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:40:34,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:34,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:38,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:38,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-28 10:40:38,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:38,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:40:38,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:40:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:40:38,516 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-28 10:40:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:38,642 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-28 10:40:38,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:40:38,651 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-28 10:40:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:38,652 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:40:38,652 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:40:38,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:40:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:40:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-28 10:40:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-28 10:40:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-28 10:40:38,656 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-28 10:40:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:38,656 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-28 10:40:38,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:40:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-28 10:40:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-28 10:40:38,657 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:38,657 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-28 10:40:38,657 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-28 10:40:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:38,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:38,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:38,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:40,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:40,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:40,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:40,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:40,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:40,220 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-02-28 10:40:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:40,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:40,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:40:40,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:40,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:44,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:44,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-28 10:40:44,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:44,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-28 10:40:44,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-28 10:40:44,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:40:44,899 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-28 10:40:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:44,996 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-28 10:40:44,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:40:44,997 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-28 10:40:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:44,998 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:40:44,998 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:40:44,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:40:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:40:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-28 10:40:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:40:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-28 10:40:45,001 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-28 10:40:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:45,002 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-28 10:40:45,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-28 10:40:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-28 10:40:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:40:45,002 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:45,002 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-28 10:40:45,003 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-28 10:40:45,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:45,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:47,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:47,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:47,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:47,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:47,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:47,274 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-02-28 10:40:47,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:47,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:47,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-28 10:40:47,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:47,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:40:47,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:47,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:52,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:52,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-28 10:40:52,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:52,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:40:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:40:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:40:52,521 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-28 10:40:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:52,621 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-28 10:40:52,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:40:52,621 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-28 10:40:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:52,622 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:40:52,622 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:40:52,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:40:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:40:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-28 10:40:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-28 10:40:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-28 10:40:52,626 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-28 10:40:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:52,626 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-28 10:40:52,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:40:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-28 10:40:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-28 10:40:52,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:52,627 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-28 10:40:52,627 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-28 10:40:52,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:52,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:52,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:54,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:54,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:54,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:54,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:54,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:54,280 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-02-28 10:40:54,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:54,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:54,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:54,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:54,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:40:54,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:54,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:00,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:00,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-28 10:41:00,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:00,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-28 10:41:00,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-28 10:41:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:41:00,765 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-28 10:41:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:01,099 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-28 10:41:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:41:01,100 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-28 10:41:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:01,100 INFO L225 Difference]: With dead ends: 73 [2019-02-28 10:41:01,100 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:41:01,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:41:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:41:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-28 10:41:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:41:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-28 10:41:01,103 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-28 10:41:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:01,103 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-28 10:41:01,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-28 10:41:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-28 10:41:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:41:01,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:01,104 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-28 10:41:01,104 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-28 10:41:01,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:01,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:01,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:01,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:01,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:03,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:03,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:03,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:03,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:03,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:03,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:03,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:03,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:03,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-28 10:41:03,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:03,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:08,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:08,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-28 10:41:08,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:08,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:41:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:41:08,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:41:08,483 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-28 10:41:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:08,580 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-28 10:41:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:41:08,581 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-28 10:41:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:08,582 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:41:08,582 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:41:08,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:41:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:41:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-28 10:41:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:41:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-28 10:41:08,585 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-28 10:41:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:08,585 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-28 10:41:08,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:41:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-28 10:41:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:41:08,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:08,586 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-28 10:41:08,586 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-28 10:41:08,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:08,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:08,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:10,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:10,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:10,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:10,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:10,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:10,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:10,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:10,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-28 10:41:10,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:10,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:41:10,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:10,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:15,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:15,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-28 10:41:15,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:15,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:41:15,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:41:15,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:41:15,982 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-28 10:41:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:16,167 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-28 10:41:16,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:41:16,167 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-28 10:41:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:16,168 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:41:16,168 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:41:16,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:41:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:41:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-28 10:41:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:41:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-28 10:41:16,170 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-28 10:41:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:16,171 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-28 10:41:16,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:41:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-28 10:41:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:41:16,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:16,171 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-28 10:41:16,172 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-28 10:41:16,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:16,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:16,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:16,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:16,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:18,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:18,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:18,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:18,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:18,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:18,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:18,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:18,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:18,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:18,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:18,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-28 10:41:18,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:18,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:23,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:23,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-28 10:41:23,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:23,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:41:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:41:23,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:41:23,603 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-28 10:41:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:23,764 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-28 10:41:23,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:41:23,765 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-28 10:41:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:23,766 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:41:23,766 INFO L226 Difference]: Without dead ends: 74 [2019-02-28 10:41:23,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:41:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-28 10:41:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-28 10:41:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-28 10:41:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-28 10:41:23,770 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-28 10:41:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:23,770 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-28 10:41:23,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:41:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-28 10:41:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-28 10:41:23,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:23,771 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-28 10:41:23,771 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:23,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:23,771 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-28 10:41:23,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:23,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:23,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:25,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:25,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:25,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:25,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:25,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:25,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:25,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:25,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:26,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:41:26,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:26,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:31,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:31,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-28 10:41:31,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:31,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-28 10:41:31,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-28 10:41:31,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:41:31,394 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-28 10:41:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:31,530 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-28 10:41:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:41:31,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-28 10:41:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:31,531 INFO L225 Difference]: With dead ends: 77 [2019-02-28 10:41:31,532 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:41:31,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:41:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:41:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-28 10:41:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:41:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-28 10:41:31,536 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-28 10:41:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:31,536 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-28 10:41:31,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-28 10:41:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-28 10:41:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-28 10:41:31,537 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:31,537 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-28 10:41:31,537 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:31,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-28 10:41:31,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:31,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:31,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:31,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:31,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:33,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:33,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:33,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:33,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:33,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:33,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:33,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:33,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:34,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-28 10:41:34,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:34,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:41:34,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:34,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:39,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:39,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-28 10:41:39,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:39,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:41:39,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:41:39,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:41:39,719 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-28 10:41:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:39,872 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-28 10:41:39,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:41:39,872 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-28 10:41:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:39,873 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:41:39,873 INFO L226 Difference]: Without dead ends: 76 [2019-02-28 10:41:39,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:41:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-28 10:41:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-28 10:41:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:41:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-28 10:41:39,876 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-28 10:41:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:39,877 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-28 10:41:39,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:41:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-28 10:41:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:41:39,877 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:39,877 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-28 10:41:39,878 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-28 10:41:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:39,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:39,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:41,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:41,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:41,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:41,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:41,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:41,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:41,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:41,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:41,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:41,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:41,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:41:41,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:41,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:47,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:47,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-28 10:41:47,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:47,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:41:47,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:41:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:41:47,770 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-28 10:41:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:47,919 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-28 10:41:47,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:41:47,919 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-28 10:41:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:47,920 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:41:47,920 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:41:47,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:41:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:41:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-28 10:41:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:41:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-28 10:41:47,922 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-28 10:41:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:47,923 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-28 10:41:47,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:41:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-28 10:41:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:41:47,923 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:47,923 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-28 10:41:47,923 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:47,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-28 10:41:47,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:47,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:47,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:50,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:50,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:50,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:50,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:50,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:50,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:50,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:50,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:50,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:41:50,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:50,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:56,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:56,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-28 10:41:56,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:56,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:41:56,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:41:56,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:41:56,213 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-28 10:41:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:56,364 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-28 10:41:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:41:56,364 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-28 10:41:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:56,365 INFO L225 Difference]: With dead ends: 80 [2019-02-28 10:41:56,365 INFO L226 Difference]: Without dead ends: 78 [2019-02-28 10:41:56,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:41:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-28 10:41:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-28 10:41:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:41:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-28 10:41:56,368 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-28 10:41:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:56,368 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-28 10:41:56,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:41:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-28 10:41:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-28 10:41:56,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:56,369 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-28 10:41:56,369 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-28 10:41:56,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:56,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:56,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:56,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:56,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:58,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:58,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:58,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:58,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:58,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:58,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:58,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:58,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:59,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-28 10:41:59,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:59,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:41:59,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:59,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:05,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:05,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-28 10:42:05,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:05,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:42:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:42:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:42:05,144 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-28 10:42:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:05,250 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-28 10:42:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:42:05,251 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-28 10:42:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:05,252 INFO L225 Difference]: With dead ends: 81 [2019-02-28 10:42:05,252 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:42:05,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:42:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:42:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-28 10:42:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:42:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-28 10:42:05,255 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-28 10:42:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:05,256 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-28 10:42:05,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:42:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-28 10:42:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-28 10:42:05,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:05,257 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-28 10:42:05,257 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-28 10:42:05,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:05,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:05,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:07,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:07,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:07,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:07,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:07,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:07,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:07,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:07,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:07,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:07,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:07,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-28 10:42:07,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:07,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:13,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:13,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-28 10:42:13,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:13,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:42:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:42:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:42:13,573 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-28 10:42:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:13,736 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-28 10:42:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:42:13,736 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-28 10:42:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:13,737 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:42:13,737 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:42:13,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:42:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:42:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-28 10:42:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:42:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-28 10:42:13,740 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-28 10:42:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:13,741 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-28 10:42:13,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:42:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-28 10:42:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:42:13,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:13,741 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-28 10:42:13,742 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-28 10:42:13,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:13,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:13,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:15,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:15,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:15,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:15,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:15,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:15,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:15,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:15,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:15,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:42:15,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:15,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:22,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:22,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-28 10:42:22,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:22,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-28 10:42:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-28 10:42:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:42:22,187 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-28 10:42:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:22,692 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-28 10:42:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:42:22,692 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-28 10:42:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:22,693 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:42:22,693 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:42:22,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:42:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:42:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-28 10:42:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:42:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-28 10:42:22,696 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-28 10:42:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:22,696 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-28 10:42:22,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-28 10:42:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-28 10:42:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:42:22,697 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:22,697 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-28 10:42:22,697 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:22,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-28 10:42:22,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:22,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:22,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:25,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:25,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:25,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:25,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:25,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:25,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:25,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:25,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:25,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-28 10:42:25,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:25,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:42:25,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:25,975 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:32,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:32,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-28 10:42:32,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:32,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:42:32,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:42:32,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:42:32,764 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-28 10:42:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:33,370 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-28 10:42:33,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:42:33,371 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-28 10:42:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:33,372 INFO L225 Difference]: With dead ends: 84 [2019-02-28 10:42:33,372 INFO L226 Difference]: Without dead ends: 82 [2019-02-28 10:42:33,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:42:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-28 10:42:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-28 10:42:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-28 10:42:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-28 10:42:33,375 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-28 10:42:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:33,375 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-28 10:42:33,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:42:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-28 10:42:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-28 10:42:33,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:33,376 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-28 10:42:33,377 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-28 10:42:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:33,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:33,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:33,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:35,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:35,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:35,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:35,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:35,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:35,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:35,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:35,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:36,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:36,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:36,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:42:36,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:36,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:42,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:42,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-28 10:42:42,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:42,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-28 10:42:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-28 10:42:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:42:42,750 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-28 10:42:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:42,905 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-28 10:42:42,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:42:42,905 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-28 10:42:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:42,905 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:42:42,906 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:42:42,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:42:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:42:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-28 10:42:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-28 10:42:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-28 10:42:42,908 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-28 10:42:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:42,908 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-28 10:42:42,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-28 10:42:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-28 10:42:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-28 10:42:42,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:42,909 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-28 10:42:42,909 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:42,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-28 10:42:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:42,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:42,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:42,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:42,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:45,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:45,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:45,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:45,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:45,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:45,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:45,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:45,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-28 10:42:45,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:45,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:52,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:52,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-28 10:42:52,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:52,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:42:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:42:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:42:52,845 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-28 10:42:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:52,976 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-28 10:42:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:42:52,977 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-28 10:42:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:52,978 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:42:52,978 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:42:52,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:42:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:42:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-28 10:42:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:42:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-28 10:42:52,982 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-28 10:42:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:52,982 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-28 10:42:52,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:42:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-28 10:42:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:42:52,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:52,983 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-28 10:42:52,983 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-28 10:42:52,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:52,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:52,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:52,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:52,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:55,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:55,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:55,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:55,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:55,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:55,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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:55,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:55,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:56,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-28 10:42:56,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:56,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:42:56,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:56,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:03,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:03,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-28 10:43:03,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:03,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:43:03,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:43:03,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:43:03,564 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-28 10:43:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:03,754 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-28 10:43:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:43:03,755 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-28 10:43:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:03,755 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:43:03,755 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:43:03,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:43:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:43:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-28 10:43:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:43:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-28 10:43:03,758 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-28 10:43:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:03,758 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-28 10:43:03,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:43:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-28 10:43:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:43:03,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:03,759 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-28 10:43:03,759 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-28 10:43:03,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:03,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:03,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:06,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:06,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:06,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:06,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:06,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:06,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:06,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:06,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:06,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:06,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:43:06,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:06,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:13,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:13,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-28 10:43:13,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:13,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:43:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:43:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:43:13,855 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-28 10:43:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:14,034 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-28 10:43:14,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:43:14,034 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-28 10:43:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:14,035 INFO L225 Difference]: With dead ends: 88 [2019-02-28 10:43:14,035 INFO L226 Difference]: Without dead ends: 86 [2019-02-28 10:43:14,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:43:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-28 10:43:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-28 10:43:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-28 10:43:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-28 10:43:14,038 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-28 10:43:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:14,038 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-28 10:43:14,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:43:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-28 10:43:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-28 10:43:14,038 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:14,039 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-28 10:43:14,039 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-28 10:43:14,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:14,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:14,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:16,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:16,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:16,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:16,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:16,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:16,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:16,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:16,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:16,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-28 10:43:16,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:16,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:24,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:24,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-28 10:43:24,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:24,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-28 10:43:24,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-28 10:43:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:43:24,190 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-28 10:43:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:24,342 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-28 10:43:24,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:43:24,343 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-28 10:43:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:24,343 INFO L225 Difference]: With dead ends: 89 [2019-02-28 10:43:24,343 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:43:24,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:43:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:43:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-28 10:43:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:43:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-28 10:43:24,346 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-28 10:43:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:24,346 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-28 10:43:24,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-28 10:43:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-28 10:43:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:43:24,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:24,346 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-28 10:43:24,347 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-28 10:43:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:24,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:24,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:24,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:24,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:27,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:27,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:27,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:27,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:27,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:27,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:27,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:28,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-28 10:43:28,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:28,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:43:28,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:28,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:35,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:35,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-28 10:43:35,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:35,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:43:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:43:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:43:35,905 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-28 10:43:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:36,052 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-28 10:43:36,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:43:36,052 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-28 10:43:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:36,053 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:43:36,053 INFO L226 Difference]: Without dead ends: 88 [2019-02-28 10:43:36,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:43:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-28 10:43:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-28 10:43:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-28 10:43:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-28 10:43:36,056 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-28 10:43:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:36,056 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-28 10:43:36,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:43:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-28 10:43:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-28 10:43:36,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:36,057 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-28 10:43:36,057 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-28 10:43:36,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:36,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:36,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:38,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:38,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:38,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:38,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:38,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:38,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:38,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:38,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:38,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:38,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:38,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:43:38,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:38,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:46,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:46,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-28 10:43:46,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:46,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-28 10:43:46,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-28 10:43:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:43:46,475 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-28 10:43:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:46,630 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-28 10:43:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:43:46,630 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-28 10:43:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:46,631 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:43:46,631 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:43:46,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:43:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:43:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-28 10:43:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:43:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-28 10:43:46,634 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-28 10:43:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:46,634 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-28 10:43:46,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-28 10:43:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-28 10:43:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:43:46,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:46,635 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-28 10:43:46,636 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-28 10:43:46,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:46,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:46,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:46,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:49,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:49,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:49,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:49,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:49,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:49,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:49,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:49,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:49,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-28 10:43:49,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:49,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:57,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:57,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-28 10:43:57,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:57,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:43:57,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:43:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:43:57,481 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-28 10:43:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:57,787 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-28 10:43:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:43:57,788 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-28 10:43:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:57,788 INFO L225 Difference]: With dead ends: 92 [2019-02-28 10:43:57,788 INFO L226 Difference]: Without dead ends: 90 [2019-02-28 10:43:57,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:43:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-28 10:43:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-28 10:43:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-28 10:43:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-28 10:43:57,791 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-28 10:43:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:57,792 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-28 10:43:57,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:43:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-28 10:43:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-28 10:43:57,792 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:57,792 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-28 10:43:57,793 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-28 10:43:57,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:57,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:00,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:00,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:00,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:00,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:00,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:00,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:00,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:00,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:01,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-28 10:44:01,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:01,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:44:01,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:01,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-28 10:44:09,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:09,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:44:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:44:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:44:09,677 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-28 10:44:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:09,892 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-28 10:44:09,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:44:09,893 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-28 10:44:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:09,893 INFO L225 Difference]: With dead ends: 93 [2019-02-28 10:44:09,893 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:44:09,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:44:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:44:09,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-28 10:44:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:44:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-28 10:44:09,896 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-28 10:44:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:09,896 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-28 10:44:09,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:44:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-28 10:44:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:44:09,897 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:09,897 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-28 10:44:09,897 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-28 10:44:09,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:09,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:09,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:09,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:09,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:12,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:12,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:12,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:12,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:12,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:12,973 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:12,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:12,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:13,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:13,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:13,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-28 10:44:13,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:13,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:21,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:21,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-28 10:44:21,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:21,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:44:21,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:44:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:44:21,175 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-28 10:44:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:21,314 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-28 10:44:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-28 10:44:21,315 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-28 10:44:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:21,316 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:44:21,316 INFO L226 Difference]: Without dead ends: 92 [2019-02-28 10:44:21,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:44:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-28 10:44:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-28 10:44:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:44:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-28 10:44:21,318 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-28 10:44:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:21,319 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-28 10:44:21,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:44:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-28 10:44:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:44:21,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:21,319 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-28 10:44:21,319 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-28 10:44:21,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:21,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:21,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:24,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:24,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:24,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:24,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:24,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:24,375 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:24,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:24,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:24,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:44:24,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:24,479 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:33,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:33,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-28 10:44:33,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:33,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:44:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:44:33,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:44:33,161 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-28 10:44:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:33,392 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-28 10:44:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:44:33,392 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-28 10:44:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:33,393 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:44:33,393 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:44:33,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:44:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:44:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-28 10:44:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:44:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-28 10:44:33,395 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-28 10:44:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:33,396 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-28 10:44:33,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:44:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-28 10:44:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:44:33,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:33,396 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-28 10:44:33,396 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-28 10:44:33,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:33,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:33,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:36,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:36,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:36,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:36,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:36,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:36,224 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:36,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:36,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:37,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-28 10:44:37,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:37,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:44:37,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:37,554 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-28 10:44:46,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:46,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:44:46,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:44:46,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:44:46,003 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-28 10:44:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:46,142 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-28 10:44:46,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:44:46,142 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-28 10:44:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:46,143 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:44:46,143 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:44:46,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:44:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:44:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-28 10:44:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-28 10:44:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-28 10:44:46,147 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-28 10:44:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:46,147 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-28 10:44:46,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:44:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-28 10:44:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-28 10:44:46,148 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:46,148 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-28 10:44:46,148 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-28 10:44:46,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:46,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:46,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:49,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:49,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:49,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:49,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:49,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:49,233 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:49,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:49,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:49,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:49,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:49,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:44:49,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:49,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:58,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:58,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-28 10:44:58,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:58,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-28 10:44:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-28 10:44:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:44:58,322 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-28 10:44:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:58,591 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-28 10:44:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:44:58,592 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-28 10:44:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:58,592 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:44:58,592 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:44:58,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:44:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:44:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-28 10:44:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:44:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-28 10:44:58,596 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-28 10:44:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:58,596 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-28 10:44:58,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-28 10:44:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-28 10:44:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-28 10:44:58,597 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:58,597 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-28 10:44:58,597 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-28 10:44:58,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:58,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:58,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:01,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:01,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:01,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:01,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:01,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:01,554 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:01,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:01,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:01,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-28 10:45:01,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:01,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:10,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:10,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-28 10:45:10,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:10,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:45:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:45:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:45:10,713 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-28 10:45:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:10,910 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-28 10:45:10,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-28 10:45:10,910 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-28 10:45:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:10,911 INFO L225 Difference]: With dead ends: 98 [2019-02-28 10:45:10,911 INFO L226 Difference]: Without dead ends: 96 [2019-02-28 10:45:10,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:45:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-28 10:45:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-28 10:45:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:45:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-28 10:45:10,914 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-28 10:45:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:10,914 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-28 10:45:10,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:45:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-28 10:45:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:45:10,915 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:10,915 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-28 10:45:10,915 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-28 10:45:10,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:10,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:10,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:10,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:10,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:14,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:14,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:14,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:14,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:14,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:14,303 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:14,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:14,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:15,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-28 10:45:15,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:15,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:45:15,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:15,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:25,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:25,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-28 10:45:25,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:25,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:45:25,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:45:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:45:25,090 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-28 10:45:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:25,252 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-28 10:45:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:45:25,252 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-28 10:45:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:25,253 INFO L225 Difference]: With dead ends: 99 [2019-02-28 10:45:25,253 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:45:25,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:45:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:45:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-28 10:45:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:45:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-28 10:45:25,255 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-28 10:45:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:25,256 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-28 10:45:25,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:45:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-28 10:45:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:45:25,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:25,256 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-28 10:45:25,256 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-28 10:45:25,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:25,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:25,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:28,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:28,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:28,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:28,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:28,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:28,650 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:28,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:28,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:28,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:28,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:28,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:45:28,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:28,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:39,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:39,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-28 10:45:39,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:39,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:45:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:45:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:45:39,145 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-28 10:45:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:39,306 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-28 10:45:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-28 10:45:39,306 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-28 10:45:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:39,307 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:45:39,307 INFO L226 Difference]: Without dead ends: 98 [2019-02-28 10:45:39,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:45:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-28 10:45:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-28 10:45:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:45:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-28 10:45:39,310 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-28 10:45:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:39,311 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-28 10:45:39,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:45:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-28 10:45:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-28 10:45:39,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:39,311 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-28 10:45:39,311 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-28 10:45:39,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:39,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:39,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:39,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:39,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:42,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:42,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:42,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:42,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:42,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:42,477 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:42,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:42,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:42,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-28 10:45:42,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:42,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:52,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:52,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-28 10:45:52,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:52,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-28 10:45:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-28 10:45:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:45:52,329 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-28 10:45:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:52,488 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-28 10:45:52,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:45:52,488 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-28 10:45:52,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:52,489 INFO L225 Difference]: With dead ends: 101 [2019-02-28 10:45:52,489 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:45:52,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:45:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:45:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-28 10:45:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-28 10:45:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-28 10:45:52,493 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-28 10:45:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:52,493 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-28 10:45:52,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-28 10:45:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-28 10:45:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-28 10:45:52,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:52,494 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-28 10:45:52,494 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-28 10:45:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:52,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:55,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:55,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:55,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:55,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:55,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:55,941 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:55,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:55,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:57,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-28 10:45:57,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:57,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:45:57,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:57,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:07,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:07,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-28 10:46:07,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:07,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:46:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:46:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:46:07,310 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-28 10:46:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:07,469 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-28 10:46:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:46:07,470 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-28 10:46:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:07,471 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:46:07,471 INFO L226 Difference]: Without dead ends: 100 [2019-02-28 10:46:07,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:46:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-28 10:46:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-28 10:46:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:46:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-28 10:46:07,475 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-28 10:46:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:07,476 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-28 10:46:07,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:46:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-28 10:46:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-28 10:46:07,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:07,477 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-28 10:46:07,477 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:07,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-28 10:46:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:07,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:07,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:11,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:11,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:11,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:11,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:11,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:11,022 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:11,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:11,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:11,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:11,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:11,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:46:11,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:11,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:21,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:21,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-28 10:46:21,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:21,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-28 10:46:21,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-28 10:46:21,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:46:21,167 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-28 10:46:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:21,374 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-28 10:46:21,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:46:21,374 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-28 10:46:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:21,374 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:46:21,375 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:46:21,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:46:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:46:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-28 10:46:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:46:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-28 10:46:21,378 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-28 10:46:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:21,378 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-28 10:46:21,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-28 10:46:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-28 10:46:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:46:21,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:21,379 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-28 10:46:21,379 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:21,379 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-28 10:46:21,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:21,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:21,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:21,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:21,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:24,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:24,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:24,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:24,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:24,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:24,977 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:24,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:24,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:25,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:46:25,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:25,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:35,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:35,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-28 10:46:35,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:35,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:46:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:46:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:46:35,344 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-28 10:46:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:35,643 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-28 10:46:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-28 10:46:35,643 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-28 10:46:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:35,644 INFO L225 Difference]: With dead ends: 104 [2019-02-28 10:46:35,644 INFO L226 Difference]: Without dead ends: 102 [2019-02-28 10:46:35,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:46:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-28 10:46:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-28 10:46:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-28 10:46:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-28 10:46:35,647 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-28 10:46:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:35,647 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-28 10:46:35,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:46:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-28 10:46:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-28 10:46:35,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:35,648 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-28 10:46:35,648 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-28 10:46:35,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:35,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:35,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:39,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:39,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:39,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:39,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:39,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:39,037 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:39,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:39,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:40,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-28 10:46:40,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:40,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:46:40,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:40,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:51,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:51,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-28 10:46:51,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:51,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:46:51,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:46:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:46:51,388 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-28 10:46:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:51,650 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-28 10:46:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:46:51,651 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-28 10:46:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:51,651 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:46:51,651 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:46:51,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:46:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:46:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-28 10:46:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:46:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-28 10:46:51,654 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-28 10:46:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:51,654 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-28 10:46:51,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:46:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-28 10:46:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-28 10:46:51,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:51,655 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-28 10:46:51,655 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-28 10:46:51,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:51,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:51,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:51,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:51,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:55,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:55,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:55,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:55,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:55,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:55,083 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:55,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:55,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:55,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:55,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:55,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:46:55,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:55,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:06,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:06,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-28 10:47:06,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:06,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:47:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:47:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:47:06,148 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-28 10:47:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:06,424 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-28 10:47:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-28 10:47:06,424 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-28 10:47:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:06,425 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:47:06,425 INFO L226 Difference]: Without dead ends: 104 [2019-02-28 10:47:06,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:47:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-28 10:47:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-28 10:47:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-28 10:47:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-28 10:47:06,429 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-28 10:47:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:06,429 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-28 10:47:06,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:47:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-28 10:47:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-28 10:47:06,430 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:06,430 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-28 10:47:06,430 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-28 10:47:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:06,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:06,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:09,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:09,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:09,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:09,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:09,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:09,989 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:09,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:09,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:10,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:47:10,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:10,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:21,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:21,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-28 10:47:21,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:21,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-28 10:47:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-28 10:47:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:47:21,122 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-28 10:47:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:21,305 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-28 10:47:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:47:21,305 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-28 10:47:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:21,306 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:47:21,306 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:47:21,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:47:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:47:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-28 10:47:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:47:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-28 10:47:21,311 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-28 10:47:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:21,311 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-28 10:47:21,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-28 10:47:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-28 10:47:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:47:21,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:21,312 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-28 10:47:21,312 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-28 10:47:21,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:21,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:21,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:21,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:21,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:24,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:24,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:24,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:24,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:24,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:24,896 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:24,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:24,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:27,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-28 10:47:27,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:27,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:47:27,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:27,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:38,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:38,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-28 10:47:38,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:38,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:47:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:47:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:47:38,094 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-28 10:47:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:38,429 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-28 10:47:38,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:47:38,432 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-28 10:47:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:38,433 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:47:38,433 INFO L226 Difference]: Without dead ends: 106 [2019-02-28 10:47:38,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:47:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-28 10:47:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-28 10:47:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-28 10:47:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-28 10:47:38,438 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-28 10:47:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:38,438 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-28 10:47:38,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:47:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-28 10:47:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-28 10:47:38,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:38,439 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-28 10:47:38,439 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-28 10:47:38,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:38,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:38,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:42,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:42,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:42,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:42,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:42,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:42,478 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:42,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:42,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:42,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:42,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:42,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-28 10:47:42,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:42,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:53,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:53,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-28 10:47:53,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:53,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:47:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:47:53,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:47:53,892 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-28 10:47:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:54,197 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-28 10:47:54,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-28 10:47:54,197 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-28 10:47:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:54,198 INFO L225 Difference]: With dead ends: 109 [2019-02-28 10:47:54,198 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:47:54,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:47:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:47:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-28 10:47:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:47:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-28 10:47:54,202 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-28 10:47:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:54,203 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-28 10:47:54,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:47:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-28 10:47:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:47:54,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:54,204 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-28 10:47:54,204 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-28 10:47:54,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:54,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:54,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:58,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:58,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:58,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:58,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:58,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:58,230 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:58,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:58,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-28 10:47:58,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:58,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:09,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:09,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-28 10:48:09,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:09,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:48:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:48:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:48:09,838 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-28 10:48:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:10,079 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-28 10:48:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-28 10:48:10,079 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-28 10:48:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:10,080 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:48:10,080 INFO L226 Difference]: Without dead ends: 108 [2019-02-28 10:48:10,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:48:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-28 10:48:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-28 10:48:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:48:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-28 10:48:10,084 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-28 10:48:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:10,084 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-28 10:48:10,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:48:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-28 10:48:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:48:10,085 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:10,085 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-28 10:48:10,085 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-28 10:48:10,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:10,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:10,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:10,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:14,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:14,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:14,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:14,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:14,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:14,229 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:14,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:14,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:16,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-28 10:48:16,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:16,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:48:16,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:16,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:28,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:28,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-28 10:48:28,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:28,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:48:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:48:28,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:48:28,715 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-28 10:48:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:28,950 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-28 10:48:28,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-28 10:48:28,950 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-28 10:48:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:28,951 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:48:28,951 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:48:28,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:48:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:48:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-28 10:48:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:48:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-28 10:48:28,955 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-28 10:48:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:28,955 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-28 10:48:28,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:48:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-28 10:48:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:48:28,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:28,956 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-28 10:48:28,957 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-28 10:48:28,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:28,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:28,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:28,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:28,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:33,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:33,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:33,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:33,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:33,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:33,144 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:33,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:33,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:33,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:33,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:33,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-28 10:48:33,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:33,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:45,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:45,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-28 10:48:45,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:45,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-28 10:48:45,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-28 10:48:45,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:48:45,007 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-28 10:48:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:45,250 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-28 10:48:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-28 10:48:45,251 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-28 10:48:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:45,251 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:48:45,251 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:48:45,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:48:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:48:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-28 10:48:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-28 10:48:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-28 10:48:45,255 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-28 10:48:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:45,255 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-28 10:48:45,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-28 10:48:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-28 10:48:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-28 10:48:45,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:45,256 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-28 10:48:45,256 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-28 10:48:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:45,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:45,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:49,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:49,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:49,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:49,488 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:49,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:49,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 108 conjunts are in the unsatisfiable core [2019-02-28 10:48:49,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:49,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:01,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:01,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-28 10:49:01,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:01,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-28 10:49:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-28 10:49:01,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-28 10:49:01,813 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-28 10:49:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:02,144 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-28 10:49:02,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-28 10:49:02,144 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-28 10:49:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:02,144 INFO L225 Difference]: With dead ends: 113 [2019-02-28 10:49:02,144 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:49:02,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-28 10:49:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:49:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-28 10:49:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:49:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-28 10:49:02,149 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-28 10:49:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:02,149 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-28 10:49:02,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-28 10:49:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-28 10:49:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:49:02,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:02,149 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-28 10:49:02,150 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-28 10:49:02,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:02,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:06,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:06,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:06,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:06,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:06,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:06,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:06,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:49:06,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:49:09,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-28 10:49:09,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:09,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:49:09,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:09,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:21,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:21,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-28 10:49:21,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:21,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-28 10:49:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-28 10:49:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:49:21,785 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-28 10:49:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:22,125 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-28 10:49:22,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-28 10:49:22,125 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-28 10:49:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:22,125 INFO L225 Difference]: With dead ends: 114 [2019-02-28 10:49:22,125 INFO L226 Difference]: Without dead ends: 112 [2019-02-28 10:49:22,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:49:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-28 10:49:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-28 10:49:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:49:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-28 10:49:22,129 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-28 10:49:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:22,129 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-28 10:49:22,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-28 10:49:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-28 10:49:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:49:22,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:22,130 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-28 10:49:22,130 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-28 10:49:22,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:22,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:22,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:26,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:26,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:26,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:26,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:26,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:26,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:26,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:26,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:26,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:26,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:26,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:49:26,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:26,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:39,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:39,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-28 10:49:39,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:39,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-28 10:49:39,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-28 10:49:39,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:49:39,486 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-28 10:49:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:39,748 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-28 10:49:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-28 10:49:39,749 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-28 10:49:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:39,750 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:49:39,750 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:49:39,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:49:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:49:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-28 10:49:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:49:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-28 10:49:39,754 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-28 10:49:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:39,754 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-28 10:49:39,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-28 10:49:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-28 10:49:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-28 10:49:39,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:39,755 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-28 10:49:39,755 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:39,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:39,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-28 10:49:39,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:39,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:39,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:43,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:43,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:43,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:43,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:43,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:43,896 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:43,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:43,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:44,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-28 10:49:44,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:44,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:57,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:57,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-28 10:49:57,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:57,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:49:57,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:49:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:49:57,179 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-28 10:49:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:57,414 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-28 10:49:57,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-28 10:49:57,414 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-28 10:49:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:57,414 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:49:57,415 INFO L226 Difference]: Without dead ends: 114 [2019-02-28 10:49:57,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:49:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-28 10:49:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-28 10:49:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-28 10:49:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-28 10:49:57,419 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-28 10:49:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:57,419 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-28 10:49:57,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:49:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-28 10:49:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-28 10:49:57,420 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:57,420 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-28 10:49:57,420 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:57,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-28 10:49:57,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:57,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:57,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:57,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:57,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:01,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:01,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:01,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:01,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:01,888 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:01,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:01,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:04,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-28 10:50:04,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:04,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-28 10:50:04,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:04,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:17,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:17,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-02-28 10:50:17,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:17,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:50:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:50:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:50:17,952 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-02-28 10:50:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:18,334 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-28 10:50:18,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-02-28 10:50:18,335 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-02-28 10:50:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:18,335 INFO L225 Difference]: With dead ends: 117 [2019-02-28 10:50:18,335 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:50:18,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:50:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:50:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-28 10:50:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-28 10:50:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-28 10:50:18,340 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-02-28 10:50:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:18,340 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-28 10:50:18,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:50:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-28 10:50:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-28 10:50:18,341 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:18,341 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-02-28 10:50:18,341 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-02-28 10:50:18,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:18,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:18,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:23,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:23,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:23,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:23,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:23,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:23,036 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:23,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:50:23,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:50:23,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:50:23,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:23,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 113 conjunts are in the unsatisfiable core [2019-02-28 10:50:23,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:23,167 INFO L322 TraceCheckSpWp]: Computing backward predicates...