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/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:36:47,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:36:47,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:36:47,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:36:47,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:36:47,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:36:47,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:36:47,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:36:47,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:36:47,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:36:47,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:36:47,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:36:47,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:36:47,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:36:47,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:36:47,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:36:47,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:36:47,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:36:47,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:36:47,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:36:47,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:36:47,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:36:47,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:36:47,378 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:36:47,378 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:36:47,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:36:47,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:36:47,381 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:36:47,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:36:47,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:36:47,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:36:47,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:36:47,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:36:47,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:36:47,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:36:47,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:36:47,387 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-25 15:36:47,401 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:36:47,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:36:47,402 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:36:47,402 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:36:47,403 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:36:47,403 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:36:47,403 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:36:47,403 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:36:47,404 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:36:47,404 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:36:47,404 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:36:47,404 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:36:47,404 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:36:47,405 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:36:47,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:36:47,406 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:36:47,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:36:47,406 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:36:47,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:36:47,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:36:47,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:36:47,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:36:47,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:36:47,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:36:47,408 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:36:47,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:36:47,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:36:47,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:36:47,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:36:47,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:36:47,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:36:47,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:36:47,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:36:47,410 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:36:47,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:36:47,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:36:47,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:36:47,411 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:36:47,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:36:47,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:36:47,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:36:47,461 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:36:47,462 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:36:47,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-02-25 15:36:47,463 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-02-25 15:36:47,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:36:47,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:36:47,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:36:47,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:36:47,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:36:47,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:36:47,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:36:47,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:36:47,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:36:47,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:36:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:36:47,863 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:36:47,863 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-25 15:36:47,865 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:47 BoogieIcfgContainer [2019-02-25 15:36:47,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:36:47,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:36:47,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:36:47,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:36:47,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/2) ... [2019-02-25 15:36:47,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eef8980 and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:36:47, skipping insertion in model container [2019-02-25 15:36:47,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:47" (2/2) ... [2019-02-25 15:36:47,873 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-02-25 15:36:47,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:36:47,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:36:47,909 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:36:47,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:36:47,942 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:36:47,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:36:47,943 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:36:47,943 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:36:47,943 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:36:47,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:36:47,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:36:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-25 15:36:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:36:47,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:47,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:36:47,969 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-25 15:36:47,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,112 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-25 15:36:48,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:36:48,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:36:48,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:36:48,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:36:48,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:36:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:36:48,132 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-25 15:36:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:48,242 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-25 15:36:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:36:48,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:36:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:48,267 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:36:48,268 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:36:48,272 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-25 15:36:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:36:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:36:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:36:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-25 15:36:48,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-25 15:36:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:48,308 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-25 15:36:48,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:36:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-25 15:36:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:36:48,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:48,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:36:48,310 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-25 15:36:48,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:36:48,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:48,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:48,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:36:48,435 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-25 15:36:48,508 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:36:48,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:36:50,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:36:50,909 INFO L272 AbstractInterpreter]: Visited 6 different actions 50 times. Merged at 4 different actions 28 times. Widened at 2 different actions 12 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:36:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:36:51,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:36:51,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:36:51,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:36:51,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:36:51,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:36:51,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:36:51,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:36:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:51,225 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-25 15:36:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:51,275 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-25 15:36:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:36:51,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:36:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:51,280 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:36:51,280 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:36:51,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:36:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:36:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:36:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-25 15:36:51,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-25 15:36:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:51,285 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-25 15:36:51,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:36:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-25 15:36:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:36:51,289 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:51,290 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-25 15:36:51,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:51,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,291 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-25 15:36:51,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:51,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:36:51,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:51,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:51,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:51,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:36:51,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:51,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:51,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:36:51,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:51,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:36:51,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:36:51,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:36:51,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-25 15:36:51,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:36:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:36:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:51,804 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-25 15:36:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:52,036 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-25 15:36:52,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:36:52,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:36:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:52,038 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:36:52,038 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:36:52,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:36:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:36:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:36:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-25 15:36:52,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-25 15:36:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:52,045 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-25 15:36:52,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:36:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-25 15:36:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:36:52,046 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:52,046 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-25 15:36:52,047 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-25 15:36:52,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:52,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:36:52,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:52,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:52,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:52,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,433 INFO 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-25 15:36:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:52,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:52,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:52,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:52,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:36:52,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:36:52,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:36:52,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:52,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-25 15:36:52,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:52,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:36:52,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:36:52,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:36:52,722 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-25 15:36:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:52,949 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-25 15:36:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:36:52,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-25 15:36:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:52,951 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:36:52,951 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:36:52,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:36:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:36:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:36:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:36:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-25 15:36:52,957 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-25 15:36:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:52,958 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-25 15:36:52,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:36:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-25 15:36:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:36:52,959 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:52,959 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-25 15:36:52,960 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-25 15:36:52,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:52,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:52,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:36:53,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:53,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:53,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:53,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:36:53,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:53,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:53,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:36:53,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:36:53,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:36:53,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:53,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-25 15:36:53,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:53,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:36:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:36:53,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:53,567 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-25 15:36:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:53,631 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-25 15:36:53,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:36:53,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-25 15:36:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:53,633 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:36:53,633 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:36:53,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:36:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-25 15:36:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:36:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-25 15:36:53,638 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-25 15:36:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:53,639 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-25 15:36:53,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:36:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-25 15:36:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-25 15:36:53,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:53,640 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-25 15:36:53,640 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-25 15:36:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:36:54,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,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 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-25 15:36:54,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:54,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:54,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:36:54,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:54,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:36:54,089 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:36:54,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:54,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-25 15:36:54,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:54,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:36:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:36:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:36:54,218 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-25 15:36:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,274 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-25 15:36:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:36:54,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-25 15:36:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,276 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:36:54,276 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:36:54,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:36:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:36:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:36:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:36:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-25 15:36:54,280 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-25 15:36:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,281 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-25 15:36:54,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:36:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-25 15:36:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:36:54,282 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,282 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-25 15:36:54,282 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-25 15:36:54,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:36:54,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,414 INFO 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-25 15:36:54,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:54,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:54,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:54,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:54,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:36:54,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:36:54,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:54,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-25 15:36:54,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:54,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:36:54,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:36:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:36:54,637 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-25 15:36:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,701 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-25 15:36:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:36:54,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-25 15:36:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,702 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:36:54,702 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:36:54,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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-25 15:36:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:36:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:36:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:36:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-25 15:36:54,707 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-25 15:36:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,708 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-25 15:36:54,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:36:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-25 15:36:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:36:54,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,708 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-25 15:36:54,709 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-25 15:36:54,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:36:54,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,876 INFO 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-25 15:36:54,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:54,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:36:54,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-25 15:36:55,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-25 15:36:55,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:55,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:36:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:36:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:36:55,103 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-25 15:36:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:55,154 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-25 15:36:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:36:55,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-25 15:36:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:55,156 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:36:55,156 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:36:55,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 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-25 15:36:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:36:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:36:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:36:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-25 15:36:55,160 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-25 15:36:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:55,160 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-25 15:36:55,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:36:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-25 15:36:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:36:55,161 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:55,161 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-25 15:36:55,162 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-25 15:36:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:36:55,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:55,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:55,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:55,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,351 INFO 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-25 15:36:55,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:55,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:55,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-25 15:36:55,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:55,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:36:55,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:36:55,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-25 15:36:55,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:55,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-25 15:36:55,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:55,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:36:55,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:36:55,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:36:55,610 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-25 15:36:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:55,745 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-25 15:36:55,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:36:55,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-25 15:36:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:55,746 INFO L225 Difference]: With dead ends: 34 [2019-02-25 15:36:55,746 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:36:55,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:36:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:36:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-25 15:36:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:36:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-25 15:36:55,751 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-25 15:36:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:55,752 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-25 15:36:55,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:36:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-25 15:36:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:36:55,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:55,753 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-25 15:36:55,753 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-25 15:36:55,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:36:55,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:55,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:55,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:55,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,882 INFO 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-25 15:36:55,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:55,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:55,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:55,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:55,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:36:55,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:36:55,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-25 15:36:56,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:56,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-25 15:36:56,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:56,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:36:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:36:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:36:56,092 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-25 15:36:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:56,173 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-25 15:36:56,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:36:56,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-25 15:36:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:56,174 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:36:56,174 INFO L226 Difference]: Without dead ends: 25 [2019-02-25 15:36:56,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 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-25 15:36:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-25 15:36:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-25 15:36:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:36:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-25 15:36:56,178 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-25 15:36:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:56,179 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-25 15:36:56,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:36:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-25 15:36:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:36:56,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:56,180 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-25 15:36:56,180 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-25 15:36:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:36:56,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:56,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:56,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:56,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,480 INFO 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-25 15:36:56,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:56,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:36:56,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:36:56,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-25 15:36:57,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:57,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-25 15:36:57,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:57,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:36:57,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:36:57,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:36:57,178 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-25 15:36:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:57,243 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-25 15:36:57,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:36:57,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-25 15:36:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:57,245 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:36:57,245 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:36:57,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:36:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:36:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-25 15:36:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:36:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-25 15:36:57,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-25 15:36:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:57,249 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-25 15:36:57,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:36:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-25 15:36:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-25 15:36:57,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:57,250 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-25 15:36:57,250 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:57,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:57,251 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-25 15:36:57,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:57,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:36:57,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:57,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:57,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:57,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,436 INFO 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-25 15:36:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:57,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:57,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-25 15:36:57,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:57,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:36:57,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:57,505 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:36:57,506 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:57,517 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:57,517 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-02-25 15:36:58,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2019-02-25 15:36:58,140 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:36:58,253 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:58,253 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-02-25 15:36:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:36:58,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-25 15:36:58,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:58,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-02-25 15:36:58,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:58,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:36:58,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:36:58,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:36:58,942 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-02-25 15:37:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:01,169 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-25 15:37:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:37:01,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-02-25 15:37:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:01,171 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:37:01,171 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:37:01,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-02-25 15:37:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:37:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-25 15:37:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:37:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-25 15:37:01,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-25 15:37:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:01,178 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-25 15:37:01,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:37:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-25 15:37:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:37:01,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:01,179 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-25 15:37:01,179 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-25 15:37:01,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:01,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:01,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:37:01,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:01,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:01,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:01,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:01,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:01,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:01,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:01,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:01,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:01,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:01,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:37:01,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:37:01,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-25 15:37:01,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:01,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-25 15:37:01,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:01,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-25 15:37:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-25 15:37:01,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:37:01,676 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-25 15:37:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:01,775 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-25 15:37:01,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:37:01,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-25 15:37:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:01,776 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:37:01,777 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:37:01,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:37:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:37:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-25 15:37:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:37:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-25 15:37:01,784 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-25 15:37:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:01,784 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-25 15:37:01,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-25 15:37:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-25 15:37:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:37:01,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:01,785 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-25 15:37:01,786 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:01,786 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-25 15:37:01,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:01,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:01,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:01,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:01,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:37:02,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:02,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:02,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:02,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,023 INFO 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-25 15:37:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:02,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:02,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:37:02,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:37:02,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-25 15:37:02,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:02,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-25 15:37:02,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:02,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:37:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:37:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:37:02,399 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-25 15:37:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:02,479 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-25 15:37:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:37:02,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-25 15:37:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:02,480 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:37:02,480 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:37:02,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:37:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:37:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-25 15:37:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:37:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-25 15:37:02,487 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-25 15:37:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:02,488 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-25 15:37:02,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:37:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-25 15:37:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:37:02,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:02,489 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-25 15:37:02,489 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-25 15:37:02,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:02,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:37:02,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:02,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:02,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:02,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,930 INFO 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-25 15:37:02,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:02,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:02,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:37:02,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:02,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:37:02,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:37:02,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-25 15:37:03,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-02-25 15:37:03,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:03,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:37:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:37:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:37:03,422 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-25 15:37:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:03,480 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-25 15:37:03,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:37:03,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-25 15:37:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:03,482 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:37:03,482 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:37:03,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:37:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:37:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-25 15:37:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:37:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-25 15:37:03,488 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-25 15:37:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:03,489 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-25 15:37:03,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:37:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-25 15:37:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:37:03,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:03,490 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-25 15:37:03,490 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-25 15:37:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:03,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:03,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:37:04,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:04,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:04,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:04,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,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 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-25 15:37:04,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:04,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:04,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:04,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:04,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:37:04,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:37:04,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-25 15:37:05,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:05,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-25 15:37:05,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:05,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:37:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:37:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:37:05,231 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-25 15:37:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:05,303 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-25 15:37:05,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:37:05,303 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-25 15:37:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:05,304 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:37:05,304 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:37:05,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:37:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:37:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-25 15:37:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:37:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-25 15:37:05,310 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-25 15:37:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:05,311 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-25 15:37:05,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:37:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-25 15:37:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:37:05,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:05,312 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-25 15:37:05,312 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-25 15:37:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:05,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:05,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:37:05,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:05,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:05,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:05,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:05,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:05,536 INFO 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-25 15:37:05,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:05,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:05,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:37:05,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:37:05,583 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-25 15:37:06,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:06,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-25 15:37:06,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:06,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-25 15:37:06,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-25 15:37:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:37:06,465 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-25 15:37:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:06,533 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-25 15:37:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:37:06,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-25 15:37:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:06,534 INFO L225 Difference]: With dead ends: 58 [2019-02-25 15:37:06,534 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:37:06,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 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-25 15:37:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:37:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-25 15:37:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:37:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-25 15:37:06,541 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-25 15:37:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:06,541 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-25 15:37:06,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-25 15:37:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-25 15:37:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-25 15:37:06,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:06,542 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-25 15:37:06,542 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:06,543 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-25 15:37:06,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:06,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:06,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:06,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:37:07,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:07,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:07,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:07,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,298 INFO 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-25 15:37:07,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:07,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:07,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-25 15:37:07,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:07,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:37:07,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:37:07,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-25 15:37:08,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:08,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-25 15:37:08,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:08,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:37:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:37:08,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:08,266 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-25 15:37:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:08,351 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-25 15:37:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:37:08,352 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-25 15:37:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:08,352 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:37:08,352 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:37:08,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:37:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-25 15:37:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:37:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-25 15:37:08,359 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-25 15:37:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:08,359 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-25 15:37:08,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:37:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-25 15:37:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:37:08,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:08,360 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-25 15:37:08,360 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-25 15:37:08,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:08,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:08,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:08,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:08,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:37:08,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:08,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:08,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:08,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:08,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:08,742 INFO 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-25 15:37:08,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:08,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:08,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:08,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:08,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:37:08,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:37:08,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-25 15:37:09,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:09,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-25 15:37:09,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:09,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-25 15:37:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-25 15:37:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:09,233 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-25 15:37:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:09,381 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-25 15:37:09,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:37:09,381 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-25 15:37:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:09,382 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:37:09,382 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:37:09,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:37:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-25 15:37:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:37:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-25 15:37:09,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-25 15:37:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:09,390 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-25 15:37:09,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-25 15:37:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-25 15:37:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:37:09,391 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:09,391 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-25 15:37:09,392 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:09,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:09,392 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-25 15:37:09,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:09,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:09,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:37:09,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:09,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:09,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:09,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:09,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:09,617 INFO 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-25 15:37:09,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:09,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:09,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:37:09,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:37:09,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-25 15:37:10,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:10,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-25 15:37:10,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:10,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:37:10,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:37:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:10,240 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-25 15:37:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:10,317 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-25 15:37:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:37:10,317 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-25 15:37:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:10,318 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:37:10,319 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:37:10,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:37:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-25 15:37:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:37:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-25 15:37:10,326 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-25 15:37:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:10,326 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-25 15:37:10,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:37:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-25 15:37:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:37:10,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:10,327 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-25 15:37:10,327 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:10,328 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-25 15:37:10,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:10,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:10,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:37:10,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:10,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:10,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:10,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:10,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:10,749 INFO 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-25 15:37:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:10,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:10,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:37:10,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:10,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:37:10,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:37:10,864 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-25 15:37:11,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:11,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-25 15:37:11,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:11,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:37:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:37:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:37:11,468 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-25 15:37:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:11,585 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-25 15:37:11,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:37:11,585 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-25 15:37:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:11,586 INFO L225 Difference]: With dead ends: 70 [2019-02-25 15:37:11,586 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:37:11,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:37:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:37:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-25 15:37:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:37:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-25 15:37:11,593 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-25 15:37:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:11,593 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-25 15:37:11,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:37:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-25 15:37:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-25 15:37:11,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:11,594 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-25 15:37:11,594 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-25 15:37:11,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:11,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:11,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:11,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:11,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:37:12,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:12,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:12,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:12,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:12,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:12,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 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-25 15:37:12,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:12,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:12,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:12,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:12,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-25 15:37:12,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:37:12,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-25 15:37:13,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:13,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-25 15:37:13,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:13,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:37:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:37:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:13,319 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-25 15:37:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:13,428 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-25 15:37:13,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:37:13,431 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-25 15:37:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:13,431 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:37:13,432 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:37:13,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:37:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-25 15:37:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:37:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-25 15:37:13,436 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-25 15:37:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:13,437 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-25 15:37:13,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:37:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-25 15:37:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:37:13,437 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:13,438 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-25 15:37:13,438 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:13,438 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-25 15:37:13,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:13,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:13,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:13,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:13,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:37:13,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:13,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:13,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:13,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:13,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:13,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:13,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:13,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:13,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-25 15:37:13,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:37:13,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-25 15:37:14,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-25 15:37:14,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:14,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-25 15:37:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-25 15:37:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:37:14,497 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-25 15:37:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:14,597 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-25 15:37:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:37:14,598 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-25 15:37:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:14,598 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:37:14,599 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:37:14,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:37:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:37:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-25 15:37:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:37:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-25 15:37:14,605 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-25 15:37:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:14,605 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-25 15:37:14,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-25 15:37:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-25 15:37:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-25 15:37:14,606 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:14,606 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-25 15:37:14,606 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:14,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:14,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-25 15:37:14,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:14,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:14,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:14,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:14,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:37:14,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:14,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:14,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:14,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:14,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:14,928 INFO 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-25 15:37:14,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:14,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:15,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:37:15,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:15,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:37:15,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:37:15,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-25 15:37:16,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:16,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-02-25 15:37:16,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:16,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:37:16,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:37:16,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:16,755 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-25 15:37:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:16,828 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-25 15:37:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:37:16,829 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-25 15:37:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:16,830 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:37:16,830 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:37:16,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:37:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-25 15:37:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:37:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-25 15:37:16,834 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-25 15:37:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:16,835 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-25 15:37:16,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:37:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-25 15:37:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:37:16,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:16,836 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-25 15:37:16,836 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-25 15:37:16,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:16,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:16,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:37:17,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:17,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:17,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:17,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:17,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:17,218 INFO 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-25 15:37:17,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:17,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:17,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:17,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:17,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:37:17,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:37:17,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-25 15:37:17,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:17,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-25 15:37:17,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:17,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:37:17,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:37:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:37:17,999 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-25 15:37:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:18,175 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-25 15:37:18,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:37:18,176 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-25 15:37:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:18,176 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:37:18,176 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:37:18,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 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-25 15:37:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:37:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-25 15:37:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:37:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-25 15:37:18,182 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-25 15:37:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:18,183 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-25 15:37:18,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:37:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-25 15:37:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:37:18,184 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:18,184 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-25 15:37:18,184 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-25 15:37:18,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:18,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:18,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:18,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:18,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:37:18,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:18,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:18,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:18,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:18,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:18,773 INFO 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-25 15:37:18,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:18,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:18,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:37:18,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:37:18,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-25 15:37:19,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:19,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-25 15:37:19,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:19,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:37:19,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:37:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:19,637 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-25 15:37:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:19,731 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-25 15:37:19,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:37:19,731 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-25 15:37:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:19,732 INFO L225 Difference]: With dead ends: 85 [2019-02-25 15:37:19,732 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:37:19,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:37:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-25 15:37:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:37:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-25 15:37:19,738 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-25 15:37:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:19,738 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-25 15:37:19,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:37:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-25 15:37:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:37:19,738 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:19,739 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-25 15:37:19,739 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:19,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-25 15:37:19,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:19,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:19,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:19,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:19,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:37:20,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:20,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:20,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:20,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:20,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:20,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:20,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:20,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-25 15:37:20,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:20,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:37:20,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:37:20,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-25 15:37:21,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:21,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-02-25 15:37:21,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:21,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:37:21,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:37:21,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:21,178 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-25 15:37:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:21,259 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-25 15:37:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:37:21,260 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-25 15:37:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:21,260 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:37:21,261 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:37:21,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:37:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-25 15:37:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:37:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-25 15:37:21,264 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-25 15:37:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:21,265 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-25 15:37:21,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:37:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-25 15:37:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:37:21,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:21,266 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-25 15:37:21,266 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-25 15:37:21,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:21,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:21,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:37:21,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:21,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:21,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:21,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:21,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:21,720 INFO 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-25 15:37:21,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:21,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:21,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:21,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:21,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-25 15:37:21,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:37:21,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-25 15:37:22,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:22,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-25 15:37:22,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:22,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:37:22,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:37:22,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:22,699 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-25 15:37:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:22,830 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-25 15:37:22,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:37:22,830 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-25 15:37:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:22,831 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:37:22,831 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:37:22,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:37:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-25 15:37:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:37:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-25 15:37:22,836 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-25 15:37:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:22,836 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-25 15:37:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:37:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-25 15:37:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:37:22,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:22,836 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-25 15:37:22,837 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-25 15:37:22,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:22,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:22,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:37:23,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:23,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:23,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:23,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:23,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:23,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:23,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:23,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:23,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:37:23,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:37:23,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-25 15:37:24,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:24,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-25 15:37:24,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-25 15:37:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-25 15:37:24,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:24,884 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-25 15:37:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:25,013 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-25 15:37:25,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:37:25,013 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-25 15:37:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:25,014 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:37:25,014 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:37:25,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:37:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-25 15:37:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:37:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-25 15:37:25,018 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-25 15:37:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:25,019 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-25 15:37:25,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-25 15:37:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-25 15:37:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:37:25,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:25,019 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-25 15:37:25,020 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-25 15:37:25,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:25,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:25,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:37:25,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:25,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:25,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:25,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,644 INFO 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-25 15:37:25,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:25,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:25,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:37:25,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:25,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:37:25,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:37:25,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-25 15:37:26,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:26,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-02-25 15:37:26,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:26,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:37:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:37:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:26,873 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-25 15:37:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:26,950 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-25 15:37:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:37:26,950 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-25 15:37:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:26,951 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:37:26,951 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:37:26,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:37:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-25 15:37:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:37:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-25 15:37:26,957 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-25 15:37:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:26,957 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-25 15:37:26,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:37:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-25 15:37:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:37:26,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:26,958 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-25 15:37:26,958 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:26,959 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-25 15:37:26,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:26,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:26,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:37:27,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:27,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:27,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:27,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:27,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:27,416 INFO 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-25 15:37:27,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:27,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:27,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:27,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:27,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:37:27,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:37:27,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-25 15:37:28,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:28,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-25 15:37:28,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:28,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-25 15:37:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-25 15:37:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:28,799 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-25 15:37:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:28,939 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-25 15:37:28,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:37:28,939 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-25 15:37:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:28,940 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:37:28,940 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:37:28,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:37:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-25 15:37:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:37:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-25 15:37:28,945 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-25 15:37:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:28,945 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-25 15:37:28,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-25 15:37:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-25 15:37:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:37:28,946 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:28,946 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-25 15:37:28,946 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-25 15:37:28,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:28,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:28,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:28,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:28,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:37:30,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:30,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:30,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:30,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:30,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:30,242 INFO 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-25 15:37:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:30,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:30,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:37:30,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:37:30,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-25 15:37:31,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:31,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-25 15:37:31,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:37:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:37:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:31,482 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-25 15:37:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:31,620 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-25 15:37:31,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:37:31,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-25 15:37:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:31,621 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:37:31,621 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:37:31,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:37:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-25 15:37:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:37:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-25 15:37:31,625 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-25 15:37:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:31,626 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-25 15:37:31,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:37:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-25 15:37:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:37:31,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:31,626 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-25 15:37:31,626 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-25 15:37:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:31,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:37:32,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:32,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:32,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:32,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:32,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:32,182 INFO 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-25 15:37:32,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:32,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:32,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-25 15:37:32,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:32,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:37:32,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:37:32,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-25 15:37:33,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:33,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-25 15:37:33,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:33,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-25 15:37:33,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-25 15:37:33,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:37:33,932 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-25 15:37:34,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:34,087 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-25 15:37:34,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:37:34,088 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-25 15:37:34,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:34,088 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:37:34,089 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:37:34,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 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-25 15:37:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:37:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-25 15:37:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:37:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-25 15:37:34,094 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-25 15:37:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:34,094 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-25 15:37:34,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-25 15:37:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-25 15:37:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-25 15:37:34,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:34,095 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-25 15:37:34,095 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-25 15:37:34,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:34,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:34,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:34,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:34,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:37:34,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:34,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:34,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:34,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:34,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:34,698 INFO 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-25 15:37:34,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:34,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:34,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:34,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:34,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:37:34,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:37:34,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-25 15:37:36,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:36,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-25 15:37:36,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:36,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:37:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:37:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:36,126 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-25 15:37:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:36,281 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-25 15:37:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:37:36,281 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-25 15:37:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:36,282 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:37:36,282 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:37:36,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:37:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-25 15:37:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:37:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-25 15:37:36,287 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-25 15:37:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:36,287 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-25 15:37:36,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:37:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-25 15:37:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:37:36,287 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:36,287 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-25 15:37:36,288 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:36,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-25 15:37:36,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:36,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:36,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:37:36,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:36,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:36,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:36,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:36,867 INFO 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-25 15:37:36,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:36,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:36,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:37:36,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:37:36,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-25 15:37:38,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-25 15:37:38,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:38,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-25 15:37:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-25 15:37:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:38,324 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-25 15:37:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:38,500 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-25 15:37:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:37:38,501 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-25 15:37:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:38,501 INFO L225 Difference]: With dead ends: 112 [2019-02-25 15:37:38,501 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:37:38,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:37:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-25 15:37:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:37:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-25 15:37:38,506 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-25 15:37:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:38,507 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-25 15:37:38,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-25 15:37:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-25 15:37:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-25 15:37:38,507 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:38,507 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-25 15:37:38,508 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:38,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-25 15:37:38,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:38,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:38,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:38,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:38,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:37:39,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:39,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:39,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:39,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:39,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:39,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 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-25 15:37:39,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:39,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:39,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-25 15:37:39,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:39,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:37:39,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:37:39,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-25 15:37:41,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:41,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-25 15:37:41,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:41,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:37:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:37:41,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:41,330 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-25 15:37:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:41,465 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-25 15:37:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:37:41,466 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-25 15:37:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:41,467 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:37:41,467 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:37:41,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:37:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-25 15:37:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:37:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-25 15:37:41,470 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-25 15:37:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:41,470 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-25 15:37:41,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:37:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-25 15:37:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:37:41,471 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:41,471 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-25 15:37:41,471 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-25 15:37:41,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:41,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:41,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:41,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:41,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:37:42,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:42,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:42,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:42,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:42,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:42,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:42,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:42,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:42,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:42,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:42,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-25 15:37:42,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:37:42,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-25 15:37:44,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:44,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-25 15:37:44,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:44,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-25 15:37:44,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-25 15:37:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:44,031 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-25 15:37:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:44,183 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-25 15:37:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:37:44,184 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-25 15:37:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:44,185 INFO L225 Difference]: With dead ends: 118 [2019-02-25 15:37:44,185 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:37:44,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:37:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-25 15:37:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:37:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-25 15:37:44,188 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-25 15:37:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:44,188 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-25 15:37:44,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-25 15:37:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-25 15:37:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:37:44,189 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:44,189 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-25 15:37:44,189 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-25 15:37:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:44,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:44,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:37:45,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:45,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:45,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:45,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:45,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:45,021 INFO 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-25 15:37:45,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:45,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:45,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:37:45,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:37:45,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-25 15:37:46,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:46,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-25 15:37:46,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:46,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:37:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:37:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:46,638 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-25 15:37:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:46,772 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-25 15:37:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:37:46,773 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-25 15:37:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:46,774 INFO L225 Difference]: With dead ends: 121 [2019-02-25 15:37:46,774 INFO L226 Difference]: Without dead ends: 81 [2019-02-25 15:37:46,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-25 15:37:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-25 15:37:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:37:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-25 15:37:46,778 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-25 15:37:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:46,779 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-25 15:37:46,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:37:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-25 15:37:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:37:46,779 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:46,779 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-25 15:37:46,779 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:46,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-25 15:37:46,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:46,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:46,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:37:47,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:47,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:47,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:47,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:47,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:47,490 INFO 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-25 15:37:47,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:47,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:48,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:37:48,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:48,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:37:48,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:37:48,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-25 15:37:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-25 15:37:49,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:49,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-25 15:37:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-25 15:37:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:37:49,840 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-25 15:37:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:49,993 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-25 15:37:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:37:49,994 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-25 15:37:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:49,994 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:37:49,995 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:37:49,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:37:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:37:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-25 15:37:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:37:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-25 15:37:49,998 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-25 15:37:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:49,999 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-25 15:37:49,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-25 15:37:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-25 15:37:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-25 15:37:49,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:49,999 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-25 15:37:49,999 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-25 15:37:50,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:50,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:50,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:50,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:37:50,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:50,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:50,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:50,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:50,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:50,695 INFO 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-25 15:37:50,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:50,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:50,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:50,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:50,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-25 15:37:50,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:37:50,792 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-25 15:37:52,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:52,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-25 15:37:52,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:52,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:37:52,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:37:52,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:37:52,520 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-25 15:37:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:52,680 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-25 15:37:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:37:52,681 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-25 15:37:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:52,681 INFO L225 Difference]: With dead ends: 127 [2019-02-25 15:37:52,681 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:37:52,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 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-25 15:37:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:37:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-25 15:37:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:37:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-25 15:37:52,685 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-25 15:37:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:52,685 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-25 15:37:52,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:37:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-25 15:37:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:37:52,686 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:52,686 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-25 15:37:52,686 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-25 15:37:52,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:52,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:52,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:37:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:53,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:53,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:53,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:53,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:53,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:53,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:53,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-25 15:37:53,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:37:53,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-25 15:37:55,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-25 15:37:55,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:55,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-25 15:37:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-25 15:37:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:37:55,888 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-25 15:37:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:56,040 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-25 15:37:56,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:37:56,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-25 15:37:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:56,041 INFO L225 Difference]: With dead ends: 130 [2019-02-25 15:37:56,041 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:37:56,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:37:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:37:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-25 15:37:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:37:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-25 15:37:56,046 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-25 15:37:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:56,046 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-25 15:37:56,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-25 15:37:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-25 15:37:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:37:56,047 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:56,047 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-25 15:37:56,047 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:56,047 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-25 15:37:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:56,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:56,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:37:56,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:56,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:56,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:56,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:56,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:56,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:56,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:56,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:57,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:37:57,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:57,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:37:57,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:37:57,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-25 15:37:59,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:59,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-25 15:37:59,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:59,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:37:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:37:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:37:59,859 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-25 15:38:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:00,012 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-25 15:38:00,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:38:00,013 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-25 15:38:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:00,014 INFO L225 Difference]: With dead ends: 133 [2019-02-25 15:38:00,014 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:38:00,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:38:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:38:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-25 15:38:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:38:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-25 15:38:00,018 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-25 15:38:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:00,018 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-25 15:38:00,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:38:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-25 15:38:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:38:00,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:00,019 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-25 15:38:00,019 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-25 15:38:00,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:00,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:00,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:00,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:00,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:38:00,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:00,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:00,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:00,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:00,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:00,895 INFO 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-25 15:38:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:00,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:00,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:00,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:00,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:38:00,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:38:00,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-25 15:38:03,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:03,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-25 15:38:03,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:03,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-25 15:38:03,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-25 15:38:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:38:03,121 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-25 15:38:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:03,269 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-25 15:38:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:38:03,270 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-25 15:38:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:03,271 INFO L225 Difference]: With dead ends: 136 [2019-02-25 15:38:03,271 INFO L226 Difference]: Without dead ends: 91 [2019-02-25 15:38:03,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:38:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-25 15:38:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-25 15:38:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:38:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-25 15:38:03,275 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-25 15:38:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:03,275 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-25 15:38:03,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-25 15:38:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-25 15:38:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:38:03,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:03,276 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-25 15:38:03,276 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-25 15:38:03,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:03,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:03,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:38:04,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:04,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:04,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:04,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:04,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:04,846 INFO 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-25 15:38:04,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:04,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:04,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-25 15:38:04,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:38:04,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-25 15:38:07,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:07,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-25 15:38:07,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:07,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:38:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:38:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:38:07,173 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-25 15:38:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:07,779 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-25 15:38:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:38:07,779 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-25 15:38:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:07,780 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:38:07,780 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:38:07,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:38:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:38:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-25 15:38:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:38:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-25 15:38:07,784 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-25 15:38:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:07,784 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-25 15:38:07,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:38:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-25 15:38:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:38:07,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:07,785 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-25 15:38:07,785 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:07,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:07,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-25 15:38:07,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:07,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:07,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:38:09,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:09,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:09,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:09,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:09,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:09,619 INFO 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-25 15:38:09,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:09,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:10,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-25 15:38:10,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:10,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:38:10,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:38:10,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-25 15:38:12,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:12,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-02-25 15:38:12,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:12,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:38:12,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:38:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:12,621 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-25 15:38:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:13,684 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-25 15:38:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:38:13,684 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-25 15:38:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:13,685 INFO L225 Difference]: With dead ends: 142 [2019-02-25 15:38:13,685 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:38:13,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:38:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-25 15:38:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:38:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-25 15:38:13,691 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-25 15:38:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:13,691 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-25 15:38:13,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:38:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-25 15:38:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-25 15:38:13,692 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:13,692 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-25 15:38:13,692 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-25 15:38:13,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:13,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:13,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:13,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:13,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:38:15,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:15,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:15,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:15,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:15,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:15,032 INFO 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-25 15:38:15,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:15,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:15,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:15,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:15,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:38:15,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:38:15,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-25 15:38:17,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:17,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-25 15:38:17,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:17,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:38:17,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:38:17,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:17,930 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-25 15:38:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:18,128 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-25 15:38:18,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:38:18,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-25 15:38:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:18,129 INFO L225 Difference]: With dead ends: 145 [2019-02-25 15:38:18,129 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:38:18,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:38:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-25 15:38:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:38:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-25 15:38:18,133 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-25 15:38:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:18,133 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-25 15:38:18,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:38:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-25 15:38:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:38:18,134 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:18,134 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-25 15:38:18,134 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-25 15:38:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:18,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:18,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:38:19,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:19,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:19,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:19,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:19,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:19,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 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-25 15:38:19,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:19,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:19,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:38:19,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:38:19,378 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-25 15:38:22,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:22,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-25 15:38:22,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:22,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-25 15:38:22,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-25 15:38:22,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:22,006 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-25 15:38:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:22,266 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-25 15:38:22,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:38:22,266 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-25 15:38:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:22,267 INFO L225 Difference]: With dead ends: 148 [2019-02-25 15:38:22,267 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:38:22,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:38:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-25 15:38:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-25 15:38:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-25 15:38:22,271 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-25 15:38:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:22,272 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-25 15:38:22,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-25 15:38:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-25 15:38:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-25 15:38:22,272 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:22,272 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-25 15:38:22,272 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-25 15:38:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:22,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:22,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:22,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:22,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:38:23,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:23,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:23,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:23,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:23,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:23,501 INFO 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-25 15:38:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:23,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:25,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:38:25,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:25,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:38:25,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:38:25,159 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-25 15:38:27,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-25 15:38:27,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:27,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:38:27,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:38:27,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:27,637 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-25 15:38:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:28,070 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-25 15:38:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:38:28,070 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-25 15:38:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:28,071 INFO L225 Difference]: With dead ends: 151 [2019-02-25 15:38:28,071 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:38:28,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:38:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-25 15:38:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:38:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-25 15:38:28,076 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-25 15:38:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:28,076 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-25 15:38:28,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:38:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-25 15:38:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:38:28,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:28,076 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-25 15:38:28,077 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-25 15:38:28,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:28,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:28,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:28,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:38:29,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:29,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:29,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:29,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:29,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:29,961 INFO 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-25 15:38:29,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:29,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:30,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:30,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:30,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:38:30,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:38:30,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-25 15:38:32,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:32,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-25 15:38:32,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:32,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-25 15:38:32,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-25 15:38:32,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:38:32,587 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-25 15:38:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:32,798 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-25 15:38:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:38:32,798 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-25 15:38:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:32,799 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:38:32,799 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:38:32,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:38:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:38:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-25 15:38:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:38:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-25 15:38:32,803 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-25 15:38:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-25 15:38:32,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-25 15:38:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-25 15:38:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:38:32,803 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:32,804 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-25 15:38:32,804 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:32,804 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-25 15:38:32,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:32,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:32,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:38:33,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:33,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:33,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:33,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:33,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:33,898 INFO 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-25 15:38:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:33,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:33,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:38:33,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:38:33,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-25 15:38:36,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:36,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-25 15:38:36,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:36,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:38:36,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:38:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:38:36,977 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-25 15:38:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:37,216 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-25 15:38:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:38:37,216 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-25 15:38:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:37,217 INFO L225 Difference]: With dead ends: 157 [2019-02-25 15:38:37,217 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:38:37,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:38:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:38:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-25 15:38:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:38:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-25 15:38:37,223 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-25 15:38:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:37,223 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-25 15:38:37,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:38:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-25 15:38:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:38:37,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:37,224 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-25 15:38:37,224 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-25 15:38:37,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:37,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:37,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:38:38,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:38,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:38,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:38,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:38,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:38,543 INFO 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-25 15:38:38,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:38,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:39,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-25 15:38:39,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:39,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:38:39,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:38:39,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-25 15:38:42,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:42,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-25 15:38:42,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:42,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:38:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:38:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:38:42,673 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-25 15:38:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:43,005 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-25 15:38:43,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:38:43,006 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-25 15:38:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:43,007 INFO L225 Difference]: With dead ends: 160 [2019-02-25 15:38:43,007 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:38:43,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:38:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:38:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-25 15:38:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:38:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-25 15:38:43,014 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-25 15:38:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:43,014 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-25 15:38:43,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:38:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-25 15:38:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-25 15:38:43,022 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:43,023 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-25 15:38:43,023 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-25 15:38:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:43,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:43,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:43,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:38:44,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:44,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:44,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:44,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:44,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:44,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 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-25 15:38:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:44,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:44,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:44,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:44,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-25 15:38:44,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:38:44,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-25 15:38:48,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:48,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-25 15:38:48,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:48,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:38:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:38:48,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:38:48,213 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-25 15:38:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:48,487 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-25 15:38:48,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:38:48,488 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-25 15:38:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:48,488 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:38:48,488 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:38:48,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:38:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:38:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-25 15:38:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:38:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-25 15:38:48,496 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-25 15:38:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:48,496 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-25 15:38:48,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:38:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-25 15:38:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:38:48,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:48,497 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-25 15:38:48,497 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-25 15:38:48,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:48,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:48,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:38:49,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:49,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:49,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:49,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:49,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:49,995 INFO 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-25 15:38:50,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:50,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:50,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:38:50,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:38:50,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-25 15:38:53,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:53,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-25 15:38:53,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:53,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:38:53,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:38:53,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:38:53,245 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-25 15:38:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:53,533 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-25 15:38:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:38:53,534 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-25 15:38:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:53,535 INFO L225 Difference]: With dead ends: 166 [2019-02-25 15:38:53,535 INFO L226 Difference]: Without dead ends: 111 [2019-02-25 15:38:53,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:38:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-25 15:38:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-25 15:38:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-25 15:38:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-25 15:38:53,538 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-25 15:38:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:53,539 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-25 15:38:53,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:38:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-25 15:38:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-25 15:38:53,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:53,539 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-25 15:38:53,540 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:53,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-25 15:38:53,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:53,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:53,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:53,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-25 15:38:54,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:54,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:54,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:54,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:54,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:54,788 INFO 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-25 15:38:54,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:54,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:56,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-25 15:38:56,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:56,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:38:56,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:56,280 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:38:56,281 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:38:56,356 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:38:56,356 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-02-25 15:39:29,389 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:39:29,590 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:29,591 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-02-25 15:39:29,597 INFO L168 Benchmark]: Toolchain (without parser) took 162096.23 ms. Allocated memory was 137.9 MB in the beginning and 757.6 MB in the end (delta: 619.7 MB). Free memory was 105.4 MB in the beginning and 255.3 MB in the end (delta: -150.0 MB). Peak memory consumption was 469.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:29,599 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:39:29,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.32 ms. Allocated memory is still 137.9 MB. Free memory was 105.2 MB in the beginning and 103.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:29,600 INFO L168 Benchmark]: Boogie Preprocessor took 21.37 ms. Allocated memory is still 137.9 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:29,600 INFO L168 Benchmark]: RCFGBuilder took 303.78 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 93.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:29,601 INFO L168 Benchmark]: TraceAbstraction took 161730.72 ms. Allocated memory was 137.9 MB in the beginning and 757.6 MB in the end (delta: 619.7 MB). Free memory was 92.9 MB in the beginning and 255.3 MB in the end (delta: -162.4 MB). Peak memory consumption was 457.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:39:29,604 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.32 ms. Allocated memory is still 137.9 MB. Free memory was 105.2 MB in the beginning and 103.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.37 ms. Allocated memory is still 137.9 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 303.78 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 93.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 161730.72 ms. Allocated memory was 137.9 MB in the beginning and 757.6 MB in the end (delta: 619.7 MB). Free memory was 92.9 MB in the beginning and 255.3 MB in the end (delta: -162.4 MB). Peak memory consumption was 457.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...