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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:01:21,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:01:21,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:01:21,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:01:21,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:01:21,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:01:21,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:01:21,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:01:21,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:01:21,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:01:21,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:01:21,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:01:21,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:01:21,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:01:21,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:01:21,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:01:21,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:01:21,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:01:21,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:01:21,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:01:21,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:01:21,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:01:21,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:01:21,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:01:21,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:01:21,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:01:21,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:01:21,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:01:21,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:01:21,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:01:21,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:01:21,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:01:21,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:01:21,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:01:21,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:01:21,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:01:21,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:01:21,376 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:01:21,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:01:21,377 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:01:21,378 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:01:21,378 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:01:21,378 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:01:21,378 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:01:21,378 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:01:21,379 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:01:21,379 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:01:21,379 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:01:21,380 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:01:21,380 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:01:21,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:01:21,381 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:01:21,381 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:01:21,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:01:21,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:01:21,381 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:01:21,382 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:01:21,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:01:21,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:01:21,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:01:21,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:01:21,383 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:01:21,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:01:21,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:01:21,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:01:21,383 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:01:21,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:01:21,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:01:21,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:01:21,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:01:21,384 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:01:21,385 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:01:21,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:01:21,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:01:21,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:01:21,385 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:01:21,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:01:21,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:01:21,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:01:21,429 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:01:21,430 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:01:21,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl [2018-12-03 18:01:21,431 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl' [2018-12-03 18:01:21,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:01:21,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:01:21,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:21,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:01:21,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:01:21,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:21,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:01:21,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:01:21,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:01:21,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... [2018-12-03 18:01:21,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:01:21,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:01:21,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:01:21,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:01:21,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:01:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:01:21,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:01:21,822 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:01:21,822 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:01:21,823 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:21 BoogieIcfgContainer [2018-12-03 18:01:21,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:01:21,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:01:21,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:01:21,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:01:21,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:21" (1/2) ... [2018-12-03 18:01:21,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b22ebb and model type simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:21, skipping insertion in model container [2018-12-03 18:01:21,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:21" (2/2) ... [2018-12-03 18:01:21,833 INFO L112 eAbstractionObserver]: Analyzing ICFG simple4.i_3.bpl [2018-12-03 18:01:21,844 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:01:21,856 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:01:21,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:01:21,918 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:01:21,919 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:01:21,919 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:01:21,919 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:01:21,919 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:01:21,919 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:01:21,920 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:01:21,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:01:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:01:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:01:21,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:21,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:01:21,959 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:21,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:21,965 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:01:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:22,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:22,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:22,278 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 18:01:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:22,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:01:22,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:01:22,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:01:22,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:01:22,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:01:22,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:01:22,310 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:01:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:22,358 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 18:01:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:01:22,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:01:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:22,370 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:01:22,371 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:01:22,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:01:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:01:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:01:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:01:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:01:22,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:01:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:22,411 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:01:22,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:01:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:01:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:01:22,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:22,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:01:22,413 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:22,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 18:01:22,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:22,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:22,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:22,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:22,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:22,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:22,615 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:01:22,617 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 18:01:22,668 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:01:22,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:01:22,778 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:01:23,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:01:23,428 INFO L272 AbstractInterpreter]: Visited 4 different actions 38 times. Merged at 3 different actions 32 times. Widened at 2 different actions 15 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:01:23,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:23,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:01:23,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:23,459 INFO L192 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 [2018-12-03 18:01:23,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:23,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:23,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:23,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:23,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:23,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 18:01:23,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:23,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:01:23,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:01:23,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:01:23,926 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 18:01:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:23,950 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:01:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:01:23,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 18:01:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:23,951 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:01:23,951 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:01:23,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:01:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:01:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:01:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:01:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:01:23,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:01:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:23,957 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:01:23,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:01:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:01:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:01:23,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:23,958 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:01:23,958 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:23,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:23,959 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 18:01:23,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:23,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:23,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:24,288 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 18:01:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:24,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:24,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:24,290 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:24,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:24,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:24,291 INFO L192 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 [2018-12-03 18:01:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:24,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:24,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:01:24,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:24,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:24,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:24,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:24,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 18:01:24,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:24,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:01:24,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:01:24,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:01:24,544 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 18:01:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:24,585 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:01:24,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:01:24,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 18:01:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:24,586 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:01:24,586 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:01:24,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:01:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:01:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:01:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:01:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:01:24,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:01:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:24,591 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:01:24,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:01:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:01:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:01:24,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:24,592 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:01:24,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:24,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 18:01:24,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:24,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:24,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:24,823 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 18:01:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:24,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:24,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:24,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:24,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:24,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:24,825 INFO L192 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 [2018-12-03 18:01:24,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:01:24,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:01:24,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:01:24,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:24,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:24,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:25,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:25,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 18:01:25,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:25,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:01:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:01:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:01:25,032 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 18:01:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:25,073 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:01:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:01:25,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 18:01:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:25,074 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:01:25,075 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:01:25,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:01:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:01:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:01:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:01:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:01:25,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:01:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:25,080 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:01:25,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:01:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:01:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:01:25,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:25,081 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 18:01:25,081 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:25,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 18:01:25,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:25,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:25,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:25,510 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 18:01:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:25,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:25,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:25,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:25,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:25,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:25,512 INFO L192 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 [2018-12-03 18:01:25,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:25,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:25,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:25,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:25,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:25,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 18:01:25,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:25,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:01:25,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:01:25,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:01:25,786 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 18:01:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:25,846 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:01:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:01:25,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 18:01:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:25,849 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:01:25,849 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:01:25,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:01:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:01:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:01:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:01:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:01:25,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:01:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:25,853 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:01:25,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:01:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:01:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:01:25,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:25,854 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:01:25,854 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:25,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 18:01:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:25,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:25,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:26,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:26,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:26,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:26,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:26,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:26,017 INFO L192 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 [2018-12-03 18:01:26,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:26,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:26,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:01:26,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:26,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:26,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 18:01:26,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:26,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:01:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:01:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:01:26,264 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 18:01:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:26,329 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:01:26,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:01:26,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 18:01:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:26,330 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:01:26,330 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:01:26,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:01:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:01:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:01:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:01:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:01:26,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:01:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:26,335 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:01:26,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:01:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:01:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:01:26,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:26,336 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:01:26,336 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:26,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:26,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 18:01:26,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:26,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:26,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:26,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:26,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:26,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:26,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:26,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:26,591 INFO L192 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 [2018-12-03 18:01:26,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:01:26,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:01:26,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:01:26,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:26,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:26,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:26,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:26,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 18:01:26,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:26,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:01:26,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:01:26,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:01:26,947 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 18:01:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:27,051 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:01:27,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:01:27,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 18:01:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:27,053 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:01:27,053 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:01:27,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:01:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:01:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:01:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:01:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:01:27,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 18:01:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:27,058 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:01:27,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:01:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:01:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:01:27,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:27,059 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 18:01:27,059 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:27,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 18:01:27,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:27,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:27,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:27,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:27,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:27,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:27,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:27,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:27,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:27,278 INFO L192 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 [2018-12-03 18:01:27,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:27,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:27,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:27,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:27,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:27,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 18:01:27,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:27,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:01:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:01:27,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:01:27,647 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 18:01:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:27,750 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:01:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:01:27,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 18:01:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:27,752 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:01:27,752 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:01:27,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:01:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:01:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 18:01:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:01:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:01:27,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 18:01:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:27,757 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:01:27,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:01:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:01:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:01:27,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:27,758 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 18:01:27,758 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:27,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:27,759 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 18:01:27,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:27,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:27,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:28,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:28,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:28,036 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:28,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:28,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:28,036 INFO L192 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 [2018-12-03 18:01:28,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:28,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:28,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 18:01:28,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:28,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:28,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:28,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:28,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 18:01:28,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:28,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:01:28,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:01:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:01:28,538 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 18:01:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:28,641 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 18:01:28,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:01:28,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 18:01:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:28,642 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:01:28,642 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:01:28,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:01:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:01:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:01:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:01:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:01:28,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 18:01:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:28,647 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:01:28,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:01:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:01:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:01:28,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:28,648 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 18:01:28,648 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:28,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:28,648 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 18:01:28,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:28,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:28,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:28,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:28,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:28,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:28,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:28,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:28,864 INFO L192 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 [2018-12-03 18:01:28,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:01:28,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:01:28,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:01:28,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:28,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:28,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:29,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 18:01:29,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:29,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:01:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:01:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:01:29,375 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 18:01:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:29,495 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 18:01:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:01:29,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 18:01:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:29,497 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:01:29,497 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:01:29,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:01:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:01:29,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:01:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:01:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 18:01:29,501 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 18:01:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:29,502 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 18:01:29,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:01:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 18:01:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:01:29,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:29,502 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 18:01:29,503 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:29,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 18:01:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:29,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:29,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:29,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:29,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:29,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:29,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:29,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:29,842 INFO L192 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 [2018-12-03 18:01:29,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:29,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:29,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:29,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:30,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:30,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 18:01:30,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:30,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:01:30,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:01:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:01:30,243 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 18:01:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:30,364 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 18:01:30,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:01:30,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 18:01:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:30,369 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:01:30,369 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:01:30,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:01:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:01:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 18:01:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:01:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 18:01:30,373 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 18:01:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:30,374 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 18:01:30,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:01:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 18:01:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:01:30,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:30,375 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 18:01:30,375 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:30,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 18:01:30,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:30,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:30,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:30,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:30,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:30,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:30,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:30,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:30,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:30,596 INFO L192 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 [2018-12-03 18:01:30,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:30,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:30,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:01:30,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:30,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:30,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:31,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:31,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 18:01:31,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:31,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:01:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:01:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 18:01:31,192 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 18:01:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:31,984 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 18:01:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:01:31,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 18:01:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:31,985 INFO L225 Difference]: With dead ends: 18 [2018-12-03 18:01:31,985 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:01:31,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 18:01:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:01:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:01:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:01:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 18:01:31,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 18:01:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:31,991 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 18:01:31,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:01:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 18:01:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:01:31,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:31,992 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 18:01:31,992 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:31,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 18:01:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:31,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:31,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:32,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:32,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:32,262 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:32,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:32,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:32,263 INFO L192 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 [2018-12-03 18:01:32,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:01:32,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:01:32,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:01:32,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:32,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:32,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:32,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:32,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 18:01:32,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:32,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:01:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:01:32,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:01:32,725 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 18:01:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:33,009 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 18:01:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:01:33,010 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 18:01:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:33,010 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:01:33,010 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:01:33,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:01:33,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:01:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 18:01:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:01:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 18:01:33,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 18:01:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:33,015 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 18:01:33,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:01:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 18:01:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:01:33,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:33,016 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 18:01:33,016 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:33,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 18:01:33,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:33,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:33,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:33,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:33,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:33,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:33,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:33,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:33,368 INFO L192 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 [2018-12-03 18:01:33,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:33,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:33,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:33,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:34,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:34,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 18:01:34,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:34,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:01:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:01:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:01:34,143 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 18:01:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:34,444 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 18:01:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:01:34,445 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 18:01:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:34,445 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:01:34,446 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:01:34,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:01:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:01:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:01:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:01:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:01:34,451 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 18:01:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:34,451 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:01:34,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:01:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:01:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:01:34,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:34,452 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 18:01:34,452 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:34,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:34,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 18:01:34,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:34,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:34,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:34,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:34,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:34,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:34,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:34,782 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:34,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:34,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:34,783 INFO L192 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 [2018-12-03 18:01:34,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:34,792 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:35,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:01:35,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:35,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:35,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:35,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:35,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 18:01:35,847 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:35,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:01:35,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:01:35,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:01:35,848 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 18:01:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:36,089 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 18:01:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:01:36,091 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 18:01:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:36,091 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:01:36,091 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:01:36,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:01:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:01:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:01:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:01:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 18:01:36,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 18:01:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:36,097 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 18:01:36,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:01:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 18:01:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:01:36,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:36,098 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 18:01:36,098 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:36,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 18:01:36,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:36,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:36,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:36,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:36,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:36,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:36,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:36,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:36,709 INFO L192 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 [2018-12-03 18:01:36,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:01:36,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:01:36,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:01:36,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:36,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:36,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:37,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:37,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 18:01:37,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:37,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:01:37,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:01:37,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:01:37,539 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 18:01:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:37,786 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 18:01:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:01:37,787 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 18:01:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:37,788 INFO L225 Difference]: With dead ends: 22 [2018-12-03 18:01:37,788 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:01:37,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:01:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:01:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:01:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:01:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 18:01:37,792 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 18:01:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:37,793 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 18:01:37,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:01:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 18:01:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:01:37,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:37,794 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 18:01:37,794 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:37,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 18:01:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:37,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:37,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:37,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:37,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:38,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:38,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:38,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:38,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:38,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:38,352 INFO L192 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 [2018-12-03 18:01:38,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:38,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:38,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:38,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:39,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:39,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 18:01:39,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:39,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:01:39,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:01:39,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:01:39,071 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 18:01:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:39,421 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 18:01:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:01:39,422 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 18:01:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:39,422 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:01:39,422 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:01:39,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:01:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:01:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:01:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:01:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:01:39,427 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 18:01:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:39,427 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:01:39,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:01:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:01:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:01:39,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:39,428 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 18:01:39,429 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:39,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 18:01:39,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:39,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:39,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:39,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:39,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:39,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:39,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:39,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:39,866 INFO L192 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 [2018-12-03 18:01:39,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:39,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:02:33,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:02:33,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:35,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:35,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:36,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:36,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 18:02:36,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:36,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:02:36,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:02:36,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:02:36,477 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 18:02:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:36,766 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 18:02:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:02:36,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 18:02:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:36,767 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:02:36,767 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:02:36,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:02:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:02:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:02:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:02:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 18:02:36,772 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 18:02:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:36,772 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 18:02:36,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:02:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 18:02:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:02:36,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:36,773 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 18:02:36,773 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:36,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 18:02:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:36,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:36,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:37,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:37,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:37,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:37,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:37,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:37,130 INFO L192 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 [2018-12-03 18:02:37,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:02:37,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:02:37,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:02:37,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:37,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:37,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:38,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:38,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 18:02:38,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:38,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:02:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:02:38,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:02:38,831 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 18:02:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:39,154 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 18:02:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:02:39,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 18:02:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:39,155 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:02:39,155 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:02:39,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:02:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:02:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:02:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:02:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 18:02:39,159 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 18:02:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:39,160 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 18:02:39,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:02:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 18:02:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:02:39,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:39,161 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 18:02:39,161 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:39,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 18:02:39,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:39,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:39,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:39,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:39,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:39,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:39,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:39,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:39,479 INFO L192 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 [2018-12-03 18:02:39,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:39,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:02:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:39,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:39,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:40,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:40,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 18:02:40,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:40,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:02:40,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:02:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:02:40,389 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 18:02:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:40,706 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 18:02:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:02:40,708 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 18:02:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:40,709 INFO L225 Difference]: With dead ends: 26 [2018-12-03 18:02:40,709 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:02:40,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:02:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:02:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:02:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:02:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 18:02:40,714 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 18:02:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:40,714 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 18:02:40,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:02:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 18:02:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:02:40,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:40,715 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 18:02:40,715 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:40,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 18:02:40,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:40,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:40,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:41,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:41,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:41,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:41,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:41,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:41,189 INFO L192 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 [2018-12-03 18:02:41,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:02:41,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:03:23,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 18:03:23,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:03:24,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:24,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:25,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:25,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 18:03:25,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:25,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:03:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:03:25,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 18:03:25,109 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 18:03:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:25,541 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 18:03:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:03:25,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 18:03:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:25,543 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:03:25,543 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:03:25,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 18:03:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:03:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:03:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:03:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 18:03:25,549 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 18:03:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:25,549 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 18:03:25,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:03:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 18:03:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:03:25,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:25,550 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 18:03:25,550 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:25,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 18:03:25,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:25,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:25,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:03:25,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:25,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:26,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:26,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:26,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:03:26,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:03:26,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:26,089 INFO L192 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 [2018-12-03 18:03:26,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:03:26,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:03:26,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:03:26,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:03:26,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:26,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:27,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:27,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 18:03:27,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:27,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:03:27,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:03:27,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 18:03:27,199 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 18:03:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:27,553 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 18:03:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:03:27,555 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 18:03:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:27,556 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:03:27,556 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:03:27,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 18:03:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:03:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:03:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:03:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 18:03:27,560 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 18:03:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:27,560 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 18:03:27,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:03:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 18:03:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:03:27,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:27,561 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 18:03:27,561 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:27,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 18:03:27,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:27,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:27,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:03:27,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:27,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:29,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:29,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:29,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:03:29,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:03:29,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:29,397 INFO L192 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 [2018-12-03 18:03:29,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:29,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:03:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:29,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:29,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:30,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:30,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 18:03:30,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:30,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:03:30,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:03:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:03:30,532 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 18:03:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:31,273 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 18:03:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:03:31,273 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 18:03:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:31,274 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:03:31,274 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:03:31,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:03:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:03:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 18:03:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 18:03:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 18:03:31,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 18:03:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:31,278 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 18:03:31,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:03:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 18:03:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:03:31,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:31,279 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 18:03:31,279 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:31,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:31,280 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 18:03:31,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:31,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:31,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:31,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:31,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:31,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:31,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:03:31,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:03:31,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:31,959 INFO L192 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 [2018-12-03 18:03:31,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:03:31,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:04:05,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 18:04:05,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:04:05,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:04:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:06,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:04:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:07,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:04:07,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 18:04:07,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:04:07,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:04:07,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:04:07,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:04:07,128 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 18:04:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:04:07,742 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 18:04:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:04:07,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 18:04:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:04:07,743 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:04:07,743 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:04:07,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:04:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:04:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:04:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:04:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 18:04:07,749 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 18:04:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:04:07,749 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 18:04:07,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:04:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 18:04:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:04:07,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:04:07,750 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 18:04:07,750 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:04:07,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:04:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 18:04:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:04:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:07,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:04:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:07,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:04:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:08,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:08,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:04:08,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:04:08,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:04:08,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:08,516 INFO L192 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 [2018-12-03 18:04:08,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:04:08,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:04:08,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:04:08,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:04:08,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:04:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:08,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:04:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:09,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:04:09,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 18:04:09,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:04:09,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:04:09,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:04:09,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:04:09,819 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 18:04:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:04:10,278 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 18:04:10,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:04:10,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 18:04:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:04:10,279 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:04:10,279 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:04:10,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:04:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:04:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:04:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:04:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 18:04:10,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 18:04:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:04:10,284 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 18:04:10,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:04:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 18:04:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:04:10,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:04:10,285 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 18:04:10,285 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:04:10,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:04:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 18:04:10,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:04:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:10,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:04:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:10,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:04:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:10,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:10,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:04:10,782 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:04:10,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:04:10,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:10,782 INFO L192 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 [2018-12-03 18:04:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:04:10,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:04:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:10,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:04:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:10,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:04:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:12,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:04:12,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 18:04:12,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:04:12,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:04:12,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:04:12,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:04:12,156 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 18:04:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:04:12,645 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 18:04:12,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:04:12,645 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 18:04:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:04:12,646 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:04:12,646 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:04:12,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:04:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:04:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:04:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:04:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 18:04:12,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 18:04:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:04:12,651 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 18:04:12,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:04:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 18:04:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:04:12,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:04:12,653 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 18:04:12,654 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:04:12,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:04:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 18:04:12,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:04:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:12,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:04:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:12,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:04:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:13,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:13,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:04:13,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:04:13,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:04:13,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:13,370 INFO L192 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 [2018-12-03 18:04:13,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:04:13,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:05:34,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:05:34,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:05:35,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:05:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:36,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:05:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:37,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:05:37,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 18:05:37,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:05:37,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:05:37,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:05:37,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 18:05:37,415 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 18:05:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:05:37,942 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 18:05:37,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:05:37,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 18:05:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:05:37,943 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:05:37,943 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:05:37,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 18:05:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:05:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:05:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:05:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 18:05:37,950 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 18:05:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:05:37,950 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 18:05:37,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:05:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 18:05:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:05:37,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:05:37,951 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 18:05:37,951 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:05:37,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:05:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 18:05:37,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:05:37,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:37,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:05:37,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:37,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:05:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:05:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:38,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:05:38,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:05:38,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:05:38,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:05:38,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:05:38,530 INFO L192 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 [2018-12-03 18:05:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:05:38,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:05:38,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:05:38,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:05:38,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:05:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:38,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:05:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:40,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:05:40,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 18:05:40,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:05:40,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:05:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:05:40,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 18:05:40,301 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 18:05:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:05:40,885 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 18:05:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:05:40,885 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 18:05:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:05:40,886 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:05:40,886 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 18:05:40,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 18:05:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 18:05:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 18:05:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:05:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 18:05:40,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 18:05:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:05:40,891 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 18:05:40,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:05:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 18:05:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:05:40,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:05:40,892 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 18:05:40,893 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:05:40,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:05:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 18:05:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:05:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:40,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:05:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:40,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:05:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:05:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:41,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:05:41,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:05:41,920 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:05:41,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:05:41,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:05:41,920 INFO L192 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 [2018-12-03 18:05:41,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:05:41,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:05:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:05:41,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:05:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:41,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:05:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:43,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:05:43,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 18:05:43,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:05:43,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:05:43,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:05:43,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:05:43,653 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 18:05:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:05:44,207 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 18:05:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:05:44,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 18:05:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:05:44,208 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:05:44,208 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:05:44,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:05:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:05:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:05:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:05:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 18:05:44,213 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 18:05:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:05:44,213 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 18:05:44,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:05:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 18:05:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:05:44,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:05:44,214 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 18:05:44,214 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:05:44,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:05:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 18:05:44,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:05:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:44,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:05:44,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:44,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:05:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:05:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:44,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:05:44,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:05:44,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:05:44,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:05:44,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:05:44,799 INFO L192 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 [2018-12-03 18:05:44,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:05:44,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:06:14,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:06:14,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:14,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:14,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:16,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:16,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 18:06:16,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:16,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:06:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:06:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 18:06:16,210 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 18:06:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:16,851 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 18:06:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:06:16,852 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 18:06:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:16,852 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:06:16,853 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:06:16,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 18:06:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:06:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:06:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:06:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 18:06:16,858 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 18:06:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:16,858 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 18:06:16,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:06:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 18:06:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:06:16,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:16,859 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 18:06:16,859 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:16,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 18:06:16,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:16,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:16,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:17,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:17,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:17,464 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:17,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:17,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:17,464 INFO L192 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 [2018-12-03 18:06:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:06:17,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:06:17,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:06:17,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:17,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:17,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:19,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:19,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2018-12-03 18:06:19,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:19,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:06:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:06:19,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 18:06:19,440 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 18:06:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:20,115 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 18:06:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:06:20,116 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 18:06:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:20,117 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:06:20,117 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:06:20,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 18:06:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:06:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 18:06:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 18:06:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 18:06:20,122 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 18:06:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:20,123 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 18:06:20,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:06:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 18:06:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:06:20,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:20,123 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 18:06:20,124 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:20,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 18:06:20,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:20,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:20,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:20,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:20,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:21,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:21,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:21,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:21,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:21,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:21,191 INFO L192 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 [2018-12-03 18:06:21,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:21,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:06:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:21,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:21,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:23,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:23,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 18:06:23,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:23,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:06:23,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:06:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:06:23,339 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 18:06:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:24,025 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 18:06:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:06:24,025 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 18:06:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:24,026 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:06:24,026 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:06:24,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:06:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:06:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:06:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:06:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 18:06:24,031 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 18:06:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:24,031 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 18:06:24,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:06:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 18:06:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:06:24,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:24,032 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 18:06:24,032 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:24,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 18:06:24,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:24,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:24,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:24,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:24,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:24,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:24,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:24,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:24,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:24,872 INFO L192 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 [2018-12-03 18:06:24,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:06:24,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:13,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 18:08:13,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:14,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:14,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:16,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:16,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 68 [2018-12-03 18:08:16,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:16,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:08:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:08:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 18:08:16,317 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 18:08:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:17,077 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 18:08:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:08:17,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 18:08:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:17,078 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:08:17,078 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:08:17,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 18:08:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:08:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:08:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:08:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:08:17,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 18:08:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:17,085 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:08:17,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:08:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:08:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:08:17,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:17,086 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 18:08:17,086 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:17,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-03 18:08:17,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:17,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:17,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:17,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:17,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:17,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:17,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:17,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:17,901 INFO L192 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 [2018-12-03 18:08:17,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:17,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:17,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:17,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:17,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:17,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:20,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:20,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 18:08:20,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:20,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:08:20,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:08:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:08:20,429 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-12-03 18:08:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:21,190 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 18:08:21,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:08:21,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-12-03 18:08:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:21,191 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:08:21,191 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:08:21,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:08:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:08:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:08:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:08:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 18:08:21,196 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 18:08:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:21,196 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 18:08:21,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:08:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 18:08:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:08:21,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:21,197 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 18:08:21,197 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:21,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-03 18:08:21,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:21,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:21,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:21,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:21,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:22,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:22,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:22,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:22,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:22,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:22,667 INFO L192 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 [2018-12-03 18:08:22,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:22,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:08:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:22,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:22,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:25,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-12-03 18:08:25,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:25,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:08:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:08:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:08:25,259 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 18:08:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:26,114 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 18:08:26,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:08:26,115 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 18:08:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:26,115 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:08:26,116 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:08:26,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:08:26,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:08:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 18:08:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:08:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 18:08:26,120 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 18:08:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:26,121 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 18:08:26,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:08:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 18:08:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:08:26,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:26,121 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 18:08:26,122 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:26,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:26,122 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-03 18:08:26,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:26,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:08:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:26,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:27,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:27,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:27,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:27,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:27,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:27,038 INFO L192 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 [2018-12-03 18:08:27,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:27,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:11:05,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 18:11:05,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:11:05,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:11:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:05,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:11:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:08,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:11:08,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 18:11:08,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:11:08,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:11:08,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:11:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 18:11:08,543 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-12-03 18:11:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:11:09,456 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 18:11:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:11:09,456 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-12-03 18:11:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:11:09,457 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:11:09,457 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:11:09,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 18:11:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:11:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:11:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:11:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 18:11:09,461 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 18:11:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:11:09,462 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 18:11:09,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:11:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 18:11:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:11:09,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:11:09,462 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 18:11:09,462 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:11:09,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:11:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-03 18:11:09,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:11:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:09,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:11:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:09,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:11:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:11:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:10,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:10,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:11:10,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:11:10,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:11:10,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:10,476 INFO L192 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 [2018-12-03 18:11:10,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:11:10,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:11:10,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:11:10,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:11:10,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:11:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:10,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:11:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:13,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:11:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 76 [2018-12-03 18:11:13,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:11:13,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:11:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:11:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 18:11:13,379 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 18:11:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:11:14,330 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 18:11:14,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:11:14,331 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 18:11:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:11:14,331 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:11:14,332 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:11:14,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 18:11:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:11:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 18:11:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:11:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 18:11:14,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 18:11:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:11:14,337 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 18:11:14,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:11:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 18:11:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 18:11:14,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:11:14,337 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 18:11:14,337 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:11:14,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:11:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-03 18:11:14,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:11:14,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:14,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:11:14,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:14,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:11:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:11:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:15,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:15,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:11:15,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:11:15,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:11:15,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:15,196 INFO L192 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 [2018-12-03 18:11:15,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:11:15,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:11:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:11:15,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:11:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:15,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:11:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:18,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:11:18,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 18:11:18,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:11:18,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:11:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:11:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:11:18,318 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-12-03 18:11:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:11:19,285 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 18:11:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:11:19,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-12-03 18:11:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:11:19,286 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:11:19,286 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:11:19,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:11:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:11:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:11:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:11:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 18:11:19,290 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 18:11:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:11:19,291 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 18:11:19,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:11:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 18:11:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:11:19,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:11:19,291 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 18:11:19,292 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:11:19,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:11:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-03 18:11:19,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:11:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:19,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:11:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:19,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:11:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:11:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:20,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:20,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:11:20,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:11:20,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:11:20,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:20,286 INFO L192 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 [2018-12-03 18:11:20,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:11:20,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:14:01,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:14:01,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:14:02,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:14:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:02,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:14:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:05,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:14:05,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 80 [2018-12-03 18:14:05,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:14:05,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:14:05,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:14:05,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1758, Invalid=4722, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:14:05,128 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 18:14:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:14:06,193 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 18:14:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:14:06,194 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 18:14:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:14:06,194 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:14:06,194 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:14:06,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1758, Invalid=4722, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:14:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:14:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 18:14:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:14:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 18:14:06,198 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 18:14:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:14:06,199 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 18:14:06,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:14:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 18:14:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:14:06,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:14:06,199 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 18:14:06,200 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:14:06,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:14:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-03 18:14:06,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:14:06,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:14:06,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:14:06,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:14:06,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:14:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:14:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:07,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:14:07,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:14:07,635 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:14:07,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:14:07,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:14:07,635 INFO L192 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 [2018-12-03 18:14:07,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:14:07,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:14:07,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:14:07,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:14:07,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:14:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:07,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:14:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:10,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:14:10,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 18:14:10,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:14:10,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:14:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:14:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1843, Invalid=4963, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 18:14:10,850 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-12-03 18:14:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:14:12,080 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 18:14:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:14:12,081 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-12-03 18:14:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:14:12,081 INFO L225 Difference]: With dead ends: 46 [2018-12-03 18:14:12,081 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:14:12,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1843, Invalid=4963, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 18:14:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:14:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:14:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:14:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 18:14:12,085 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 18:14:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:14:12,085 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 18:14:12,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:14:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 18:14:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:14:12,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:14:12,086 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 18:14:12,086 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:14:12,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:14:12,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-03 18:14:12,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:14:12,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:14:12,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:14:12,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:14:12,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:14:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:14:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:13,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:14:13,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:14:13,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:14:13,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:14:13,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:14:13,157 INFO L192 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 [2018-12-03 18:14:13,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:14:13,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:14:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:14:13,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:14:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:13,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:14:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:16,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:14:16,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 84 [2018-12-03 18:14:16,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:14:16,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:14:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:14:16,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1930, Invalid=5210, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:14:16,968 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 18:14:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:14:18,253 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 18:14:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:14:18,253 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 18:14:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:14:18,254 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:14:18,254 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:14:18,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1930, Invalid=5210, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:14:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:14:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 18:14:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:14:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 18:14:18,257 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 18:14:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:14:18,257 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 18:14:18,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:14:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 18:14:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:14:18,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:14:18,257 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 18:14:18,258 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:14:18,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:14:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-03 18:14:18,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:14:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:14:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:14:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:14:18,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:14:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:14:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:19,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:14:19,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:14:19,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:14:19,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:14:19,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:14:19,218 INFO L192 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 [2018-12-03 18:14:19,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:14:19,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)