java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:13:33,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:13:33,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:13:33,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:13:33,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:13:33,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:13:33,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:13:33,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:13:33,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:13:33,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:13:33,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:13:33,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:13:33,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:13:33,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:13:33,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:13:33,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:13:33,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:13:33,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:13:33,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:13:33,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:13:33,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:13:33,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:13:33,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:13:33,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:13:33,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:13:33,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:13:33,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:13:33,192 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:13:33,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:13:33,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:13:33,198 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:13:33,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:13:33,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:13:33,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:13:33,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:13:33,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:13:33,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-24 14:13:33,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:13:33,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:13:33,225 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:13:33,225 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:13:33,225 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:13:33,225 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:13:33,225 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:13:33,226 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:13:33,226 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:13:33,226 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:13:33,226 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:13:33,226 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:13:33,227 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:13:33,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:13:33,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:13:33,228 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:13:33,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:13:33,230 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:13:33,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:13:33,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:13:33,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:13:33,231 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:13:33,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:13:33,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:13:33,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:13:33,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:13:33,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:13:33,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:13:33,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:13:33,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:13:33,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:13:33,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:13:33,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:13:33,234 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:13:33,234 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:13:33,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:13:33,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:13:33,235 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:13:33,235 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:13:33,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:13:33,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:13:33,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:13:33,316 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:13:33,317 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:13:33,318 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2018-12-24 14:13:33,319 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2018-12-24 14:13:33,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:13:33,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:13:33,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:13:33,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:13:33,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:13:33,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:13:33,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:13:33,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:13:33,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:13:33,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:13:33,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:13:33,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:13:33,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:13:33,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (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-24 14:13:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 14:13:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 14:13:33,702 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 14:13:33,702 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-24 14:13:33,703 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:13:33 BoogieIcfgContainer [2018-12-24 14:13:33,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:13:33,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:13:33,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:13:33,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:13:33,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/2) ... [2018-12-24 14:13:33,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cdd840 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:13:33, skipping insertion in model container [2018-12-24 14:13:33,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:13:33" (2/2) ... [2018-12-24 14:13:33,711 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2018-12-24 14:13:33,722 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:13:33,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 14:13:33,747 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 14:13:33,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:13:33,791 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:13:33,791 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:13:33,791 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:13:33,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:13:33,792 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:13:33,792 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:13:33,792 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:13:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-24 14:13:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:13:33,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:33,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:13:33,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-24 14:13:33,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:33,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:33,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:33,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:33,999 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-24 14:13:34,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:13:34,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 14:13:34,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:13:34,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:13:34,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:13:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:13:34,021 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-24 14:13:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:34,063 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-24 14:13:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:13:34,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 14:13:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:34,077 INFO L225 Difference]: With dead ends: 9 [2018-12-24 14:13:34,077 INFO L226 Difference]: Without dead ends: 5 [2018-12-24 14:13:34,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:13:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-24 14:13:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-24 14:13:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-24 14:13:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-24 14:13:34,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-24 14:13:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:34,113 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-24 14:13:34,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:13:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-24 14:13:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:13:34,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:34,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:13:34,115 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-24 14:13:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:34,272 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-24 14:13:34,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:34,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:34,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:13:34,275 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-24 14:13:34,345 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:13:34,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:13:36,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:13:36,443 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:13:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:36,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:13:36,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:36,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:36,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:36,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:36,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:36,534 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-24 14:13:36,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:36,714 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-24 14:13:36,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:36,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-24 14:13:36,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:36,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:13:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:13:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 14:13:36,740 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-24 14:13:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:36,765 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-24 14:13:36,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:13:36,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 14:13:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:36,767 INFO L225 Difference]: With dead ends: 8 [2018-12-24 14:13:36,767 INFO L226 Difference]: Without dead ends: 6 [2018-12-24 14:13:36,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 14:13:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-24 14:13:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-24 14:13:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 14:13:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-24 14:13:36,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-24 14:13:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:36,771 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-24 14:13:36,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:13:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-24 14:13:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:13:36,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:36,772 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 14:13:36,773 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-24 14:13:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:36,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:36,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:36,959 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-24 14:13:36,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:36,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:36,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:36,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:36,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:36,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:13:36,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:36,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:37,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 14:13:37,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:37,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:37,021 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-24 14:13:37,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:37,151 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-24 14:13:37,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:37,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-24 14:13:37,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:37,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:13:37,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:13:37,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:13:37,173 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-24 14:13:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:37,228 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-24 14:13:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:13:37,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-24 14:13:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:37,229 INFO L225 Difference]: With dead ends: 9 [2018-12-24 14:13:37,230 INFO L226 Difference]: Without dead ends: 7 [2018-12-24 14:13:37,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:13:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-24 14:13:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-24 14:13:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 14:13:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-24 14:13:37,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-24 14:13:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:37,233 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-24 14:13:37,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:13:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-24 14:13:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:13:37,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:37,234 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-24 14:13:37,234 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-24 14:13:37,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:37,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:37,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:37,330 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-24 14:13:37,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:37,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:37,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:37,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:37,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:37,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:37,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:37,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:37,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:37,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:37,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:37,387 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-24 14:13:37,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:37,713 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-24 14:13:37,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-24 14:13:37,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:37,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:13:37,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:13:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:13:37,744 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-24 14:13:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:37,855 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-24 14:13:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:13:37,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-24 14:13:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:37,857 INFO L225 Difference]: With dead ends: 10 [2018-12-24 14:13:37,857 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 14:13:37,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:13:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 14:13:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-24 14:13:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 14:13:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-24 14:13:37,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-24 14:13:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:37,865 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-24 14:13:37,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:13:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-24 14:13:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:13:37,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:37,866 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-24 14:13:37,867 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:37,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-24 14:13:37,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:37,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:37,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:38,177 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-24 14:13:38,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:38,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:38,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:38,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:38,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:38,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:13:38,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:38,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:38,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:38,207 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-24 14:13:38,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:38,316 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-24 14:13:38,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:38,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-24 14:13:38,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:38,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 14:13:38,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 14:13:38,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:13:38,340 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-24 14:13:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:38,366 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-24 14:13:38,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:13:38,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 14:13:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:38,367 INFO L225 Difference]: With dead ends: 11 [2018-12-24 14:13:38,367 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 14:13:38,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:13:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 14:13:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 14:13:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 14:13:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-24 14:13:38,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-24 14:13:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:38,370 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-24 14:13:38,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 14:13:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-24 14:13:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:13:38,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:38,371 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-24 14:13:38,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-24 14:13:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:38,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:38,500 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-24 14:13:38,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:38,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:38,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:38,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:38,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:38,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:13:38,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:38,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:38,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 14:13:38,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:38,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:38,529 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-24 14:13:38,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:38,693 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-24 14:13:38,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:38,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-24 14:13:38,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:38,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:13:38,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:13:38,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:13:38,715 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-24 14:13:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:38,748 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-24 14:13:38,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:13:38,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-24 14:13:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:38,750 INFO L225 Difference]: With dead ends: 12 [2018-12-24 14:13:38,750 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 14:13:38,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:13:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 14:13:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-24 14:13:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 14:13:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-24 14:13:38,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-24 14:13:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:38,753 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-24 14:13:38,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:13:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-24 14:13:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 14:13:38,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:38,754 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-24 14:13:38,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-24 14:13:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:38,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:38,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:39,170 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-24 14:13:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:39,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:39,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:39,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:39,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:39,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:39,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:39,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:39,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:39,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:39,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:39,209 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-24 14:13:39,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:39,504 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-24 14:13:39,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:39,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-24 14:13:39,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:39,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 14:13:39,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 14:13:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:13:39,526 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-24 14:13:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:39,552 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-24 14:13:39,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:13:39,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-24 14:13:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:39,553 INFO L225 Difference]: With dead ends: 13 [2018-12-24 14:13:39,553 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 14:13:39,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:13:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 14:13:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 14:13:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 14:13:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-24 14:13:39,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-24 14:13:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:39,557 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-24 14:13:39,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 14:13:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-24 14:13:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:13:39,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:39,558 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-24 14:13:39,558 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-24 14:13:39,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:39,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:39,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:39,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:39,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:39,717 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-24 14:13:39,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:39,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:39,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:39,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:39,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:39,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:39,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:39,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:39,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:39,745 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-24 14:13:39,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:40,007 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-24 14:13:40,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:40,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-24 14:13:40,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:40,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:13:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:13:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:13:40,030 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-24 14:13:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:40,066 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-24 14:13:40,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:13:40,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-24 14:13:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:40,071 INFO L225 Difference]: With dead ends: 14 [2018-12-24 14:13:40,071 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 14:13:40,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:13:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 14:13:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-24 14:13:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-24 14:13:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-24 14:13:40,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-24 14:13:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:40,074 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-24 14:13:40,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:13:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-24 14:13:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-24 14:13:40,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:40,075 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-24 14:13:40,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-24 14:13:40,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:40,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:40,193 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-24 14:13:40,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:40,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:40,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:40,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:40,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:40,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-24 14:13:40,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:40,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:40,221 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-24 14:13:40,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:40,524 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-24 14:13:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:40,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-24 14:13:40,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:40,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:13:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:13:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:13:40,547 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-24 14:13:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:40,584 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-24 14:13:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 14:13:40,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-24 14:13:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:40,585 INFO L225 Difference]: With dead ends: 15 [2018-12-24 14:13:40,585 INFO L226 Difference]: Without dead ends: 13 [2018-12-24 14:13:40,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:13:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-24 14:13:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-24 14:13:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 14:13:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-24 14:13:40,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-24 14:13:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:40,589 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-24 14:13:40,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:13:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-24 14:13:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 14:13:40,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:40,590 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-24 14:13:40,590 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-24 14:13:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:40,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:40,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:40,715 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-24 14:13:40,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:40,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:40,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:40,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:40,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:40,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:40,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:40,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:40,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:40,745 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-24 14:13:40,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:40,977 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-24 14:13:40,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:40,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-24 14:13:40,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:40,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:13:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:13:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:13:40,999 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-24 14:13:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:41,034 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-24 14:13:41,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:13:41,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-24 14:13:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:41,035 INFO L225 Difference]: With dead ends: 16 [2018-12-24 14:13:41,035 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 14:13:41,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:13:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 14:13:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-24 14:13:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-24 14:13:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-24 14:13:41,039 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-24 14:13:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:41,039 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-24 14:13:41,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:13:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-24 14:13:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-24 14:13:41,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:41,040 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-24 14:13:41,040 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-24 14:13:41,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:41,154 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-24 14:13:41,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:41,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:41,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:41,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:41,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:41,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:41,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:41,186 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-24 14:13:41,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:41,387 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-24 14:13:41,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:41,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-24 14:13:41,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:41,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 14:13:41,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 14:13:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 14:13:41,408 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-24 14:13:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:41,469 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-24 14:13:41,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 14:13:41,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-24 14:13:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:41,470 INFO L225 Difference]: With dead ends: 17 [2018-12-24 14:13:41,470 INFO L226 Difference]: Without dead ends: 15 [2018-12-24 14:13:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 14:13:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-24 14:13:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-24 14:13:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-24 14:13:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-24 14:13:41,474 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-24 14:13:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:41,474 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-24 14:13:41,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 14:13:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-24 14:13:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-24 14:13:41,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:41,475 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-24 14:13:41,475 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:41,476 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-24 14:13:41,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:41,709 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-24 14:13:41,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:41,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:41,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:41,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:41,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:41,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:41,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-24 14:13:41,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:41,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:41,783 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-24 14:13:41,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:42,264 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-24 14:13:42,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:42,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-24 14:13:42,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:42,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:13:42,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:13:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:13:42,286 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-24 14:13:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:42,338 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-24 14:13:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 14:13:42,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-24 14:13:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:42,340 INFO L225 Difference]: With dead ends: 18 [2018-12-24 14:13:42,340 INFO L226 Difference]: Without dead ends: 16 [2018-12-24 14:13:42,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:13:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-24 14:13:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-24 14:13:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 14:13:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-24 14:13:42,343 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-24 14:13:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:42,344 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-24 14:13:42,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:13:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-24 14:13:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-24 14:13:42,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:42,344 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-24 14:13:42,345 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-24 14:13:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:42,526 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-24 14:13:42,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:42,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:42,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:42,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:42,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:42,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:42,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:42,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:42,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:42,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:42,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:42,561 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-24 14:13:42,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:42,894 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-24 14:13:42,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:42,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-24 14:13:42,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:42,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-24 14:13:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-24 14:13:42,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-24 14:13:42,917 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-24 14:13:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:42,980 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-24 14:13:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 14:13:42,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-24 14:13:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:42,981 INFO L225 Difference]: With dead ends: 19 [2018-12-24 14:13:42,981 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 14:13:42,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-24 14:13:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 14:13:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-24 14:13:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 14:13:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-24 14:13:42,985 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-24 14:13:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:42,986 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-24 14:13:42,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-24 14:13:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-24 14:13:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-24 14:13:42,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:42,987 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-24 14:13:42,987 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-24 14:13:42,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:42,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:42,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:43,267 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-24 14:13:43,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:43,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:43,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:43,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:43,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:43,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:43,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:43,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:43,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:43,300 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-24 14:13:43,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:43,764 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-24 14:13:43,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:43,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-24 14:13:43,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:43,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 14:13:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 14:13:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 14:13:43,786 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-24 14:13:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:43,820 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-24 14:13:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 14:13:43,833 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-24 14:13:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:43,834 INFO L225 Difference]: With dead ends: 20 [2018-12-24 14:13:43,834 INFO L226 Difference]: Without dead ends: 18 [2018-12-24 14:13:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 14:13:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-24 14:13:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-24 14:13:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-24 14:13:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-24 14:13:43,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-24 14:13:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:43,840 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-24 14:13:43,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 14:13:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-24 14:13:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-24 14:13:43,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:43,843 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-24 14:13:43,844 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:43,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-24 14:13:43,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:43,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:43,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:43,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:44,125 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-24 14:13:44,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:44,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:44,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:44,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:44,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:44,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:44,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:44,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:44,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-24 14:13:44,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:44,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:44,272 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-24 14:13:44,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:44,879 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-24 14:13:44,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:44,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-24 14:13:44,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:44,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-24 14:13:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-24 14:13:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:13:44,902 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-24 14:13:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:44,944 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-24 14:13:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 14:13:44,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-24 14:13:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:44,945 INFO L225 Difference]: With dead ends: 21 [2018-12-24 14:13:44,945 INFO L226 Difference]: Without dead ends: 19 [2018-12-24 14:13:44,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:13:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-24 14:13:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-24 14:13:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 14:13:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-24 14:13:44,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-24 14:13:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:44,950 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-24 14:13:44,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-24 14:13:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-24 14:13:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-24 14:13:44,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:44,951 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-24 14:13:44,951 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-24 14:13:44,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:44,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:44,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:45,227 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-24 14:13:45,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:45,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:45,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:45,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:45,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:45,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:45,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:45,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:45,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:45,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:45,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:45,261 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-24 14:13:45,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:45,805 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-24 14:13:45,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:45,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-24 14:13:45,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:45,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 14:13:45,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 14:13:45,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 14:13:45,826 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-24 14:13:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:45,860 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-24 14:13:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 14:13:45,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-24 14:13:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:45,862 INFO L225 Difference]: With dead ends: 22 [2018-12-24 14:13:45,862 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 14:13:45,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 14:13:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 14:13:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-24 14:13:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-24 14:13:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-24 14:13:45,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-24 14:13:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:45,868 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-24 14:13:45,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 14:13:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-24 14:13:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-24 14:13:45,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:45,869 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-24 14:13:45,869 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-24 14:13:45,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:45,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:45,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:46,473 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-24 14:13:46,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:46,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:46,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:46,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:46,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:46,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:46,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:46,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:46,519 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-24 14:13:46,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:47,380 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-24 14:13:47,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:47,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-24 14:13:47,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:47,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-24 14:13:47,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-24 14:13:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 14:13:47,401 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-24 14:13:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:47,425 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-24 14:13:47,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 14:13:47,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-24 14:13:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:47,426 INFO L225 Difference]: With dead ends: 23 [2018-12-24 14:13:47,426 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 14:13:47,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 14:13:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 14:13:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-24 14:13:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 14:13:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-24 14:13:47,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-24 14:13:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:47,430 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-24 14:13:47,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-24 14:13:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-24 14:13:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 14:13:47,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:47,430 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-24 14:13:47,431 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-24 14:13:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:47,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:47,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:47,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:47,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:47,624 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-24 14:13:47,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:47,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:47,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:47,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:47,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:47,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:47,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:47,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:47,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-24 14:13:47,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:47,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:47,664 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-24 14:13:47,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:48,574 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-24 14:13:48,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:48,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-24 14:13:48,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:48,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 14:13:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 14:13:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:13:48,597 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-24 14:13:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:48,624 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-24 14:13:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 14:13:48,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-24 14:13:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:48,627 INFO L225 Difference]: With dead ends: 24 [2018-12-24 14:13:48,627 INFO L226 Difference]: Without dead ends: 22 [2018-12-24 14:13:48,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:13:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-24 14:13:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-24 14:13:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 14:13:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-24 14:13:48,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-24 14:13:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:48,632 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-24 14:13:48,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 14:13:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-24 14:13:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-24 14:13:48,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:48,633 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-24 14:13:48,633 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:48,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-24 14:13:48,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:48,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:48,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:48,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:49,365 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-24 14:13:49,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:49,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:49,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:49,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:49,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:49,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:13:49,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:49,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:49,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:49,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:49,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:49,399 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-24 14:13:49,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:49,961 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-24 14:13:49,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:49,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-24 14:13:49,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:49,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-24 14:13:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-24 14:13:49,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 14:13:49,983 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-24 14:13:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:50,081 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-24 14:13:50,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 14:13:50,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-24 14:13:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:50,083 INFO L225 Difference]: With dead ends: 25 [2018-12-24 14:13:50,083 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 14:13:50,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 14:13:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 14:13:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-24 14:13:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 14:13:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-24 14:13:50,087 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-24 14:13:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:50,087 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-24 14:13:50,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-24 14:13:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-24 14:13:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-24 14:13:50,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:50,088 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-24 14:13:50,088 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-24 14:13:50,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:50,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:50,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:50,321 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-24 14:13:50,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:50,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:50,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:50,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:50,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:50,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:50,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:50,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:50,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:50,354 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-24 14:13:50,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:50,883 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-24 14:13:50,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:50,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-24 14:13:50,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:50,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 14:13:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 14:13:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 14:13:50,906 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-24 14:13:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:50,973 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-24 14:13:50,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 14:13:50,974 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-24 14:13:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:50,975 INFO L225 Difference]: With dead ends: 26 [2018-12-24 14:13:50,976 INFO L226 Difference]: Without dead ends: 24 [2018-12-24 14:13:50,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 14:13:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-24 14:13:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-24 14:13:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-24 14:13:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-24 14:13:50,982 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-24 14:13:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:50,982 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-24 14:13:50,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 14:13:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-24 14:13:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-24 14:13:50,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:50,983 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-24 14:13:50,983 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-24 14:13:50,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:50,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:50,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:50,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:51,294 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-24 14:13:51,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:51,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:51,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:51,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:51,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:51,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:51,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:51,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-24 14:13:51,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:51,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:51,351 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-24 14:13:51,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:52,410 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-24 14:13:52,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:52,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-24 14:13:52,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:52,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-24 14:13:52,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-24 14:13:52,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:13:52,433 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-24 14:13:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:52,470 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-24 14:13:52,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 14:13:52,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-24 14:13:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:52,471 INFO L225 Difference]: With dead ends: 27 [2018-12-24 14:13:52,471 INFO L226 Difference]: Without dead ends: 25 [2018-12-24 14:13:52,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:13:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-24 14:13:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-24 14:13:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 14:13:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-24 14:13:52,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-24 14:13:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:52,476 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-24 14:13:52,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-24 14:13:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-24 14:13:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 14:13:52,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:52,477 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-24 14:13:52,477 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-24 14:13:52,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:52,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:52,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:52,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:52,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:52,740 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-24 14:13:52,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:52,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:52,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:52,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:52,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:52,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:52,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:52,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:52,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:52,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:52,777 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-24 14:13:52,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:53,475 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-24 14:13:53,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:53,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-24 14:13:53,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:53,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 14:13:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 14:13:53,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 14:13:53,497 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-24 14:13:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:53,573 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-24 14:13:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 14:13:53,577 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-24 14:13:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:53,577 INFO L225 Difference]: With dead ends: 28 [2018-12-24 14:13:53,577 INFO L226 Difference]: Without dead ends: 26 [2018-12-24 14:13:53,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 14:13:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-24 14:13:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-24 14:13:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 14:13:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-24 14:13:53,581 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-24 14:13:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:53,581 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-24 14:13:53,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 14:13:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-24 14:13:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-24 14:13:53,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:53,582 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-24 14:13:53,582 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-24 14:13:53,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:53,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:53,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:53,949 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-24 14:13:53,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:53,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:53,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:53,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:53,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:53,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:53,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:53,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:53,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:53,984 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-24 14:13:53,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:54,598 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-24 14:13:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:54,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-24 14:13:54,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:54,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-24 14:13:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-24 14:13:54,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-24 14:13:54,618 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-24 14:13:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:54,654 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-24 14:13:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 14:13:54,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-24 14:13:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:54,655 INFO L225 Difference]: With dead ends: 29 [2018-12-24 14:13:54,655 INFO L226 Difference]: Without dead ends: 27 [2018-12-24 14:13:54,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-24 14:13:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-24 14:13:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-24 14:13:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-24 14:13:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-24 14:13:54,660 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-24 14:13:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:54,660 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-24 14:13:54,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-24 14:13:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-24 14:13:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-24 14:13:54,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:54,661 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-24 14:13:54,661 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-24 14:13:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:54,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:54,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:55,021 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-24 14:13:55,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:55,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:55,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:55,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:55,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:55,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:13:55,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:55,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:55,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-24 14:13:55,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:55,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:55,075 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-24 14:13:55,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:55,787 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-24 14:13:55,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:55,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-24 14:13:55,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:55,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 14:13:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 14:13:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:13:55,809 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-24 14:13:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:55,852 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-24 14:13:55,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 14:13:55,853 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-24 14:13:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:55,854 INFO L225 Difference]: With dead ends: 30 [2018-12-24 14:13:55,854 INFO L226 Difference]: Without dead ends: 28 [2018-12-24 14:13:55,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:13:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-24 14:13:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-24 14:13:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 14:13:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-24 14:13:55,862 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-24 14:13:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:55,862 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-24 14:13:55,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 14:13:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-24 14:13:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-24 14:13:55,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:55,863 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-24 14:13:55,863 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-24 14:13:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:55,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:55,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:56,359 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-24 14:13:56,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:56,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:56,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:56,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:56,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:56,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:56,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:56,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:56,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:56,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:56,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:56,398 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-24 14:13:56,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:57,313 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-24 14:13:57,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:57,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-24 14:13:57,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:57,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-24 14:13:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-24 14:13:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 14:13:57,334 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-24 14:13:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:57,427 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-24 14:13:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 14:13:57,428 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-24 14:13:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:57,429 INFO L225 Difference]: With dead ends: 31 [2018-12-24 14:13:57,429 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 14:13:57,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 14:13:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 14:13:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-24 14:13:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 14:13:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-24 14:13:57,433 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-24 14:13:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:57,433 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-24 14:13:57,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-24 14:13:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-24 14:13:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-24 14:13:57,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:57,434 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-24 14:13:57,434 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-24 14:13:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:57,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:57,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:57,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:58,353 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-24 14:13:58,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:58,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:58,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:58,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:58,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:58,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:58,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:58,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:58,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:58,390 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-24 14:13:58,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:00,004 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-24 14:14:00,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:00,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-24 14:14:00,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:00,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 14:14:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 14:14:00,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 14:14:00,026 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-24 14:14:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:00,091 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-24 14:14:00,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 14:14:00,092 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-24 14:14:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:00,092 INFO L225 Difference]: With dead ends: 32 [2018-12-24 14:14:00,092 INFO L226 Difference]: Without dead ends: 30 [2018-12-24 14:14:00,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 14:14:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-24 14:14:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-24 14:14:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-24 14:14:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-24 14:14:00,097 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-24 14:14:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:00,097 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-24 14:14:00,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 14:14:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-24 14:14:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-24 14:14:00,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:00,098 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-24 14:14:00,098 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:00,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-24 14:14:00,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:00,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:00,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:00,468 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-24 14:14:00,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:00,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:00,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:00,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:00,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:00,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:00,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:00,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:00,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-24 14:14:00,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:00,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:00,530 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-24 14:14:00,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:01,420 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-24 14:14:01,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:01,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-24 14:14:01,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:01,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-24 14:14:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-24 14:14:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:14:01,443 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-24 14:14:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:01,679 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-24 14:14:01,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 14:14:01,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-24 14:14:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:01,680 INFO L225 Difference]: With dead ends: 33 [2018-12-24 14:14:01,680 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 14:14:01,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:14:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 14:14:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-24 14:14:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 14:14:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-24 14:14:01,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-24 14:14:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:01,686 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-24 14:14:01,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-24 14:14:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-24 14:14:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 14:14:01,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:01,687 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-24 14:14:01,687 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:01,688 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-24 14:14:01,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:01,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:01,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:01,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:03,068 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-24 14:14:03,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:03,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:03,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:03,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:03,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:03,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:03,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:03,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:03,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:03,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:03,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:03,121 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-24 14:14:03,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:04,032 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-24 14:14:04,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:04,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-24 14:14:04,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:04,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 14:14:04,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 14:14:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 14:14:04,056 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-24 14:14:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:04,087 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-24 14:14:04,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 14:14:04,087 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-24 14:14:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:04,088 INFO L225 Difference]: With dead ends: 34 [2018-12-24 14:14:04,088 INFO L226 Difference]: Without dead ends: 32 [2018-12-24 14:14:04,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 14:14:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-24 14:14:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-24 14:14:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 14:14:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-24 14:14:04,103 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-24 14:14:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:04,103 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-24 14:14:04,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 14:14:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-24 14:14:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-24 14:14:04,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:04,104 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-24 14:14:04,105 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:04,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:04,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-24 14:14:04,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:04,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:04,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:04,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:04,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:04,730 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-24 14:14:04,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:04,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:04,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:04,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:04,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:04,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:04,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:04,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:04,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:04,775 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-24 14:14:04,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:06,187 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-24 14:14:06,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:06,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-24 14:14:06,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:06,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-24 14:14:06,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-24 14:14:06,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-24 14:14:06,208 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-24 14:14:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:06,284 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-24 14:14:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 14:14:06,284 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-24 14:14:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:06,285 INFO L225 Difference]: With dead ends: 35 [2018-12-24 14:14:06,285 INFO L226 Difference]: Without dead ends: 33 [2018-12-24 14:14:06,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-24 14:14:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-24 14:14:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-24 14:14:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 14:14:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-24 14:14:06,289 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-24 14:14:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:06,290 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-24 14:14:06,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-24 14:14:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-24 14:14:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-24 14:14:06,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:06,291 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-24 14:14:06,291 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:06,291 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-24 14:14:06,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:06,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:06,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:06,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:06,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:06,954 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-24 14:14:06,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:06,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:06,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:06,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:06,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:06,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:06,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:06,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:07,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-24 14:14:07,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:07,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:07,025 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-24 14:14:07,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:08,280 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-24 14:14:08,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:08,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-24 14:14:08,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:08,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 14:14:08,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 14:14:08,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:14:08,303 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-24 14:14:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:08,357 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-24 14:14:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 14:14:08,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-24 14:14:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:08,359 INFO L225 Difference]: With dead ends: 36 [2018-12-24 14:14:08,359 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 14:14:08,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:14:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 14:14:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-24 14:14:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 14:14:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-24 14:14:08,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-24 14:14:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:08,363 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-24 14:14:08,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 14:14:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-24 14:14:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-24 14:14:08,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:08,364 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-24 14:14:08,364 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-24 14:14:08,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:08,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:08,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:08,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:08,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:08,774 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-24 14:14:08,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:08,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:08,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:08,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:08,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:08,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:08,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:08,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:08,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:08,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:08,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:08,817 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-24 14:14:08,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:09,870 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-24 14:14:09,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:09,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-24 14:14:09,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:09,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-24 14:14:09,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-24 14:14:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 14:14:09,891 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-24 14:14:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:09,971 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-24 14:14:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 14:14:09,972 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-24 14:14:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:09,972 INFO L225 Difference]: With dead ends: 37 [2018-12-24 14:14:09,972 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 14:14:09,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 14:14:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 14:14:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-24 14:14:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 14:14:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-24 14:14:09,975 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-24 14:14:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:09,975 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-24 14:14:09,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-24 14:14:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-24 14:14:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-24 14:14:09,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:09,976 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-24 14:14:09,976 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-24 14:14:09,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:09,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:09,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:09,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:10,440 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-24 14:14:10,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:10,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:10,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:10,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:10,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:10,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:10,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:10,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:10,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:10,480 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-24 14:14:10,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:11,689 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-24 14:14:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:11,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-24 14:14:11,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:11,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 14:14:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 14:14:11,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 14:14:11,711 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-24 14:14:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:11,786 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-24 14:14:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 14:14:11,787 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-24 14:14:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:11,788 INFO L225 Difference]: With dead ends: 38 [2018-12-24 14:14:11,788 INFO L226 Difference]: Without dead ends: 36 [2018-12-24 14:14:11,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 14:14:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-24 14:14:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-24 14:14:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 14:14:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-24 14:14:11,792 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-24 14:14:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:11,792 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-24 14:14:11,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 14:14:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-24 14:14:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-24 14:14:11,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:11,793 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-24 14:14:11,793 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:11,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-24 14:14:11,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:11,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:11,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:11,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:11,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:12,276 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-24 14:14:12,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:12,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:12,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:12,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:12,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:12,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:12,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:12,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:12,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-24 14:14:12,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:12,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:12,363 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-24 14:14:12,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:13,813 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-24 14:14:13,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:13,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-24 14:14:13,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:13,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-24 14:14:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-24 14:14:13,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:14:13,835 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-24 14:14:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:13,875 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-24 14:14:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 14:14:13,875 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-24 14:14:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:13,876 INFO L225 Difference]: With dead ends: 39 [2018-12-24 14:14:13,876 INFO L226 Difference]: Without dead ends: 37 [2018-12-24 14:14:13,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:14:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-24 14:14:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-24 14:14:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 14:14:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-24 14:14:13,881 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-24 14:14:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:13,881 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-24 14:14:13,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-24 14:14:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-24 14:14:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 14:14:13,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:13,882 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-24 14:14:13,882 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-24 14:14:13,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:13,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:13,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:13,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:14,374 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-24 14:14:14,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:14,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:14,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:14,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:14,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:14,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:14:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:14,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:14,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:14,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:14,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:14,420 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-24 14:14:14,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:15,693 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-24 14:14:15,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:15,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-24 14:14:15,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:15,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 14:14:15,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 14:14:15,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 14:14:15,715 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-24 14:14:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:15,819 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-24 14:14:15,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 14:14:15,820 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-24 14:14:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:15,821 INFO L225 Difference]: With dead ends: 40 [2018-12-24 14:14:15,821 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 14:14:15,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 14:14:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 14:14:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-24 14:14:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-24 14:14:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-24 14:14:15,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-24 14:14:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:15,825 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-24 14:14:15,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 14:14:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-24 14:14:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-24 14:14:15,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:15,825 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-24 14:14:15,826 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-24 14:14:15,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:15,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:15,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:16,430 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-24 14:14:16,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:16,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:16,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:16,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:16,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:16,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:16,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:16,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:16,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:16,484 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-24 14:14:16,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:18,496 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-24 14:14:18,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:18,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-24 14:14:18,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:18,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-24 14:14:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-24 14:14:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 14:14:18,516 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-24 14:14:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:18,588 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-24 14:14:18,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 14:14:18,589 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-24 14:14:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:18,589 INFO L225 Difference]: With dead ends: 41 [2018-12-24 14:14:18,590 INFO L226 Difference]: Without dead ends: 39 [2018-12-24 14:14:18,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 14:14:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-24 14:14:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-24 14:14:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 14:14:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-24 14:14:18,593 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-24 14:14:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:18,593 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-24 14:14:18,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-24 14:14:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-24 14:14:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-24 14:14:18,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:18,594 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-24 14:14:18,594 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-24 14:14:18,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:18,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:18,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:18,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:19,148 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-24 14:14:19,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:19,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:19,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:19,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:19,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:19,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:19,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:19,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-24 14:14:19,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:19,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:19,248 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-24 14:14:19,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:20,723 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-24 14:14:20,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:20,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-24 14:14:20,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:20,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 14:14:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 14:14:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:14:20,744 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-24 14:14:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:20,799 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-24 14:14:20,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 14:14:20,799 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-24 14:14:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:20,800 INFO L225 Difference]: With dead ends: 42 [2018-12-24 14:14:20,800 INFO L226 Difference]: Without dead ends: 40 [2018-12-24 14:14:20,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:14:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-24 14:14:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-24 14:14:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 14:14:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-24 14:14:20,804 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-24 14:14:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:20,804 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-24 14:14:20,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 14:14:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-24 14:14:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-24 14:14:20,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:20,805 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-24 14:14:20,805 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-24 14:14:20,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:20,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:20,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:20,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:20,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:21,739 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-24 14:14:21,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:21,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:21,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:21,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:21,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:21,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:21,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:21,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:21,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:21,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:21,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:21,781 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-24 14:14:21,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:23,595 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-24 14:14:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-24 14:14:23,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:23,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-24 14:14:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-24 14:14:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 14:14:23,616 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-24 14:14:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:23,677 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-24 14:14:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 14:14:23,678 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-24 14:14:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:23,678 INFO L225 Difference]: With dead ends: 43 [2018-12-24 14:14:23,679 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 14:14:23,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 14:14:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 14:14:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-24 14:14:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 14:14:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-24 14:14:23,681 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-24 14:14:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:23,681 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-24 14:14:23,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-24 14:14:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-24 14:14:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 14:14:23,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:23,683 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-24 14:14:23,683 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-24 14:14:23,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:23,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:23,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:24,332 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-24 14:14:24,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:24,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:24,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:24,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:24,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:24,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:24,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:24,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:24,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:24,389 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-24 14:14:24,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:25,937 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-24 14:14:25,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:25,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-24 14:14:25,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 14:14:25,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 14:14:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 14:14:25,958 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-24 14:14:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:26,027 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-24 14:14:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 14:14:26,028 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-24 14:14:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:26,029 INFO L225 Difference]: With dead ends: 44 [2018-12-24 14:14:26,029 INFO L226 Difference]: Without dead ends: 42 [2018-12-24 14:14:26,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 14:14:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-24 14:14:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-24 14:14:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-24 14:14:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-24 14:14:26,032 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-24 14:14:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:26,032 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-24 14:14:26,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 14:14:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-24 14:14:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-24 14:14:26,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:26,033 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-24 14:14:26,033 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:26,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-24 14:14:26,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:26,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:26,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:26,692 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-24 14:14:26,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:26,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:26,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:26,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:26,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:26,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:26,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:26,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:26,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-24 14:14:26,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:26,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:26,803 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-24 14:14:26,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:28,802 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-24 14:14:28,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:28,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-24 14:14:28,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:28,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-24 14:14:28,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-24 14:14:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:14:28,824 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-24 14:14:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:28,909 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-24 14:14:28,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 14:14:28,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-24 14:14:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:28,911 INFO L225 Difference]: With dead ends: 45 [2018-12-24 14:14:28,911 INFO L226 Difference]: Without dead ends: 43 [2018-12-24 14:14:28,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:14:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-24 14:14:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-24 14:14:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 14:14:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-24 14:14:28,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-24 14:14:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:28,914 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-24 14:14:28,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-24 14:14:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-24 14:14:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-24 14:14:28,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:28,915 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-24 14:14:28,915 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-24 14:14:28,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:28,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:28,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:28,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:28,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:29,652 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-24 14:14:29,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:29,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:29,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:29,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:29,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:29,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:29,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:29,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:29,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:29,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:29,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:29,698 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-24 14:14:29,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:31,679 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-24 14:14:31,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:31,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-24 14:14:31,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:31,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 14:14:31,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 14:14:31,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 14:14:31,699 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-24 14:14:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:31,775 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-24 14:14:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 14:14:31,776 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-24 14:14:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:31,776 INFO L225 Difference]: With dead ends: 46 [2018-12-24 14:14:31,777 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 14:14:31,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 14:14:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 14:14:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-24 14:14:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-24 14:14:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-24 14:14:31,780 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-24 14:14:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:31,780 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-24 14:14:31,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 14:14:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-24 14:14:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-24 14:14:31,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:31,781 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-24 14:14:31,782 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:31,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-24 14:14:31,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:31,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:31,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:32,512 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-24 14:14:32,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:32,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:32,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:32,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:32,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:32,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:32,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:32,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:32,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:32,572 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-24 14:14:32,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:34,803 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-24 14:14:34,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:34,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-24 14:14:34,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:34,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-24 14:14:34,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-24 14:14:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 14:14:34,824 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-24 14:14:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:34,928 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-24 14:14:34,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 14:14:34,929 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-24 14:14:34,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:34,930 INFO L225 Difference]: With dead ends: 47 [2018-12-24 14:14:34,930 INFO L226 Difference]: Without dead ends: 45 [2018-12-24 14:14:34,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 14:14:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-24 14:14:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-24 14:14:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 14:14:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-24 14:14:34,933 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-24 14:14:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:34,933 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-24 14:14:34,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-24 14:14:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-24 14:14:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-24 14:14:34,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:34,934 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-24 14:14:34,934 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:34,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:34,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-24 14:14:34,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:34,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:34,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:35,683 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-24 14:14:35,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:35,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:35,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:35,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:35,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:35,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:35,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:35,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:35,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-24 14:14:35,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:35,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:35,816 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-24 14:14:35,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:37,744 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-24 14:14:37,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:37,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-24 14:14:37,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:37,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 14:14:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 14:14:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:14:37,765 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-24 14:14:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:37,841 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-24 14:14:37,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 14:14:37,842 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-24 14:14:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:37,843 INFO L225 Difference]: With dead ends: 48 [2018-12-24 14:14:37,843 INFO L226 Difference]: Without dead ends: 46 [2018-12-24 14:14:37,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:14:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-24 14:14:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-24 14:14:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-24 14:14:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-24 14:14:37,846 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-24 14:14:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:37,847 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-24 14:14:37,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 14:14:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-24 14:14:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-24 14:14:37,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:37,848 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-24 14:14:37,848 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-24 14:14:37,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:37,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:37,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:38,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:38,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:38,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:38,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:38,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:38,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:38,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:38,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:38,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:38,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:38,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:38,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:40,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-24 14:14:40,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:40,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-24 14:14:40,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-24 14:14:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 14:14:40,888 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-24 14:14:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:40,943 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-24 14:14:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 14:14:40,944 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-24 14:14:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:40,945 INFO L225 Difference]: With dead ends: 49 [2018-12-24 14:14:40,945 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 14:14:40,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 14:14:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 14:14:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-24 14:14:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 14:14:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-24 14:14:40,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-24 14:14:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:40,949 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-24 14:14:40,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-24 14:14:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-24 14:14:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-24 14:14:40,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:40,950 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-24 14:14:40,950 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-24 14:14:40,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:40,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:40,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:41,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:41,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:41,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:41,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:41,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:41,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:41,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:41,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:41,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:41,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:44,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:44,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-24 14:14:44,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:44,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 14:14:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 14:14:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 14:14:44,326 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-24 14:14:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:44,406 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-24 14:14:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 14:14:44,407 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-24 14:14:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:44,407 INFO L225 Difference]: With dead ends: 50 [2018-12-24 14:14:44,407 INFO L226 Difference]: Without dead ends: 48 [2018-12-24 14:14:44,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 14:14:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-24 14:14:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-24 14:14:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-24 14:14:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-24 14:14:44,414 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-24 14:14:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:44,414 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-24 14:14:44,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 14:14:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-24 14:14:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-24 14:14:44,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:44,415 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-24 14:14:44,415 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-24 14:14:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:44,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:44,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:46,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:46,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:46,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:46,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:46,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:46,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:46,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:46,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:46,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-24 14:14:46,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:46,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:46,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:49,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:49,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-24 14:14:49,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:49,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-24 14:14:49,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-24 14:14:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:14:49,131 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-24 14:14:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:49,256 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-24 14:14:49,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 14:14:49,256 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-24 14:14:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:49,257 INFO L225 Difference]: With dead ends: 51 [2018-12-24 14:14:49,257 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 14:14:49,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:14:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 14:14:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-24 14:14:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 14:14:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-24 14:14:49,261 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-24 14:14:49,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:49,261 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-24 14:14:49,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-24 14:14:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-24 14:14:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 14:14:49,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:49,262 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-24 14:14:49,262 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-24 14:14:49,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:49,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:49,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:50,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:50,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:50,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:50,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:50,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:50,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:50,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:50,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:50,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:50,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:50,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-24 14:14:52,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:52,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 14:14:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 14:14:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 14:14:52,562 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-24 14:14:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:52,940 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-24 14:14:52,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 14:14:52,941 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-24 14:14:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:52,942 INFO L225 Difference]: With dead ends: 52 [2018-12-24 14:14:52,942 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 14:14:52,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 14:14:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 14:14:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-24 14:14:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 14:14:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-24 14:14:52,944 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-24 14:14:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:52,944 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-24 14:14:52,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 14:14:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-24 14:14:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-24 14:14:52,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:52,945 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-24 14:14:52,945 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-24 14:14:52,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:52,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:52,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:52,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:54,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:54,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:54,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:54,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:54,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:54,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:54,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:54,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:54,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:54,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:56,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:56,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-24 14:14:56,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:56,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-24 14:14:56,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-24 14:14:56,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 14:14:56,648 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-24 14:14:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:56,742 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-24 14:14:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 14:14:56,743 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-24 14:14:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:56,744 INFO L225 Difference]: With dead ends: 53 [2018-12-24 14:14:56,744 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 14:14:56,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 14:14:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 14:14:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-24 14:14:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 14:14:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-24 14:14:56,747 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-24 14:14:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:56,747 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-24 14:14:56,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-24 14:14:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-24 14:14:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-24 14:14:56,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:56,748 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-24 14:14:56,748 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-24 14:14:56,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:56,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:57,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:57,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:57,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:57,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:57,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:57,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:57,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:57,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:57,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-24 14:14:57,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:57,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:57,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:00,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:00,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-24 14:15:00,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:00,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 14:15:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 14:15:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:15:00,963 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-24 14:15:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:01,040 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-24 14:15:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 14:15:01,040 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-24 14:15:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:01,041 INFO L225 Difference]: With dead ends: 54 [2018-12-24 14:15:01,042 INFO L226 Difference]: Without dead ends: 52 [2018-12-24 14:15:01,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:15:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-24 14:15:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-24 14:15:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 14:15:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-24 14:15:01,046 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-24 14:15:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:01,046 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-24 14:15:01,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 14:15:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-24 14:15:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-24 14:15:01,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:01,047 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-24 14:15:01,047 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:01,047 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-24 14:15:01,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:01,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:01,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:01,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:01,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:02,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:02,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:02,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:02,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:02,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:02,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:02,131 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:15:02,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:15:02,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:15:02,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:02,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:02,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:05,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:05,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-24 14:15:05,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:05,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-24 14:15:05,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-24 14:15:05,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 14:15:05,147 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-24 14:15:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:05,299 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-24 14:15:05,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 14:15:05,300 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-24 14:15:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:05,301 INFO L225 Difference]: With dead ends: 55 [2018-12-24 14:15:05,301 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 14:15:05,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 14:15:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 14:15:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-24 14:15:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 14:15:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-24 14:15:05,305 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-24 14:15:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:05,305 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-24 14:15:05,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-24 14:15:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-24 14:15:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-24 14:15:05,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:05,306 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-24 14:15:05,306 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:05,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-24 14:15:05,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:05,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:05,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:06,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:06,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:06,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:06,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:06,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:06,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:06,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:06,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:06,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:09,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:09,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-24 14:15:09,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:09,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 14:15:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 14:15:09,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 14:15:09,507 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-24 14:15:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:09,570 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-24 14:15:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 14:15:09,570 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-24 14:15:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:09,571 INFO L225 Difference]: With dead ends: 56 [2018-12-24 14:15:09,571 INFO L226 Difference]: Without dead ends: 54 [2018-12-24 14:15:09,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 14:15:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-24 14:15:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-24 14:15:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-24 14:15:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-24 14:15:09,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-24 14:15:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:09,575 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-24 14:15:09,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 14:15:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-24 14:15:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-24 14:15:09,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:09,576 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-24 14:15:09,576 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-24 14:15:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:09,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:09,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:10,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:10,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:10,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:10,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:10,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:10,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:10,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:10,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:10,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-24 14:15:10,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:10,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:10,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:13,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:13,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-24 14:15:13,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:13,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-24 14:15:13,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-24 14:15:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:15:13,727 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-24 14:15:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:13,940 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-24 14:15:13,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 14:15:13,940 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-24 14:15:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:13,941 INFO L225 Difference]: With dead ends: 57 [2018-12-24 14:15:13,941 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 14:15:13,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:15:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 14:15:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-24 14:15:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 14:15:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-24 14:15:13,944 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-24 14:15:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:13,945 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-24 14:15:13,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-24 14:15:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-24 14:15:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-24 14:15:13,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:13,945 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-24 14:15:13,946 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-24 14:15:13,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:13,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:13,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:13,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:13,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:15,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:15,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:15,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:15,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:15,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:15,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:15,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:15:15,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:15:15,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:15:15,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:15,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:15,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:18,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:18,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-24 14:15:18,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:18,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 14:15:18,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 14:15:18,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 14:15:18,080 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-24 14:15:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:18,176 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-24 14:15:18,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 14:15:18,176 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-24 14:15:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:18,177 INFO L225 Difference]: With dead ends: 58 [2018-12-24 14:15:18,177 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 14:15:18,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 14:15:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 14:15:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-24 14:15:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-24 14:15:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-24 14:15:18,180 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-24 14:15:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:18,180 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-24 14:15:18,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 14:15:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-24 14:15:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-24 14:15:18,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:18,181 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-24 14:15:18,181 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-24 14:15:18,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:18,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:18,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:18,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:19,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:19,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:19,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:19,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:19,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:19,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:19,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:19,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:19,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:22,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:22,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-24 14:15:22,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:22,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-24 14:15:22,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-24 14:15:22,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 14:15:22,660 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-24 14:15:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:22,753 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-24 14:15:22,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 14:15:22,754 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-24 14:15:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:22,755 INFO L225 Difference]: With dead ends: 59 [2018-12-24 14:15:22,755 INFO L226 Difference]: Without dead ends: 57 [2018-12-24 14:15:22,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 14:15:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-24 14:15:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-24 14:15:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-24 14:15:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-24 14:15:22,758 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-24 14:15:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:22,758 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-24 14:15:22,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-24 14:15:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-24 14:15:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-24 14:15:22,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:22,759 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-24 14:15:22,759 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-24 14:15:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:22,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:22,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:23,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:23,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:23,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:23,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:23,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:23,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:24,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:24,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:24,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-24 14:15:24,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:24,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:24,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:27,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:27,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-24 14:15:27,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:27,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 14:15:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 14:15:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:15:27,334 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-24 14:15:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:27,408 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-24 14:15:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 14:15:27,408 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-24 14:15:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:27,409 INFO L225 Difference]: With dead ends: 60 [2018-12-24 14:15:27,409 INFO L226 Difference]: Without dead ends: 58 [2018-12-24 14:15:27,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:15:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-24 14:15:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-24 14:15:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-24 14:15:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-24 14:15:27,413 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-24 14:15:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:27,413 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-24 14:15:27,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 14:15:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-24 14:15:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-24 14:15:27,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:27,413 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-24 14:15:27,414 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-24 14:15:27,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:27,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:27,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:28,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:28,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:28,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:28,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:28,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:28,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:28,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:15:28,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:15:28,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:15:28,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:28,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:28,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:32,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:32,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-24 14:15:32,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:32,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-24 14:15:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-24 14:15:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 14:15:32,196 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-24 14:15:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:32,291 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-24 14:15:32,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 14:15:32,292 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-24 14:15:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:32,293 INFO L225 Difference]: With dead ends: 61 [2018-12-24 14:15:32,293 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 14:15:32,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 14:15:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 14:15:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-24 14:15:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 14:15:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-24 14:15:32,295 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-24 14:15:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:32,296 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-24 14:15:32,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-24 14:15:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-24 14:15:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-24 14:15:32,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:32,296 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-24 14:15:32,297 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:32,297 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-24 14:15:32,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:32,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:32,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:32,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:32,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:33,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:33,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:33,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:33,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:33,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:33,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:33,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:33,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:33,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:33,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:37,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:37,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-24 14:15:37,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:37,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 14:15:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 14:15:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 14:15:37,167 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-24 14:15:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:37,284 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-24 14:15:37,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 14:15:37,285 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-24 14:15:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:37,286 INFO L225 Difference]: With dead ends: 62 [2018-12-24 14:15:37,286 INFO L226 Difference]: Without dead ends: 60 [2018-12-24 14:15:37,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 14:15:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-24 14:15:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-24 14:15:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-24 14:15:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-24 14:15:37,290 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-24 14:15:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:37,290 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-24 14:15:37,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 14:15:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-24 14:15:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-24 14:15:37,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:37,291 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-24 14:15:37,291 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-24 14:15:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:37,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:38,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:38,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:38,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:38,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:38,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:38,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:38,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:38,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:38,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-24 14:15:38,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:38,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:38,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:42,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:42,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-24 14:15:42,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:42,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-24 14:15:42,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-24 14:15:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:15:42,644 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-24 14:15:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:42,721 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-24 14:15:42,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 14:15:42,721 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-24 14:15:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:42,722 INFO L225 Difference]: With dead ends: 63 [2018-12-24 14:15:42,722 INFO L226 Difference]: Without dead ends: 61 [2018-12-24 14:15:42,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:15:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-24 14:15:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-24 14:15:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 14:15:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-24 14:15:42,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-24 14:15:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:42,727 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-24 14:15:42,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-24 14:15:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-24 14:15:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 14:15:42,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:42,728 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-24 14:15:42,728 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-24 14:15:42,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:42,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:42,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:44,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:44,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:44,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:44,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:44,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:44,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:44,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:15:44,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:15:44,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:15:44,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:44,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:44,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-24 14:15:48,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:48,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 14:15:48,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 14:15:48,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 14:15:48,047 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-24 14:15:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:48,154 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-24 14:15:48,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 14:15:48,154 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-24 14:15:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:48,155 INFO L225 Difference]: With dead ends: 64 [2018-12-24 14:15:48,155 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 14:15:48,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 14:15:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 14:15:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-24 14:15:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-24 14:15:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-24 14:15:48,158 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-24 14:15:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:48,158 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-24 14:15:48,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 14:15:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-24 14:15:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-24 14:15:48,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:48,159 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-24 14:15:48,159 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-24 14:15:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:48,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:48,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:49,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:49,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:49,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:49,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:49,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:49,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:49,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:49,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:49,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:53,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:53,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-24 14:15:53,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:53,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-24 14:15:53,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-24 14:15:53,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 14:15:53,624 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-24 14:15:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:53,721 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-24 14:15:53,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 14:15:53,721 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-24 14:15:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:53,722 INFO L225 Difference]: With dead ends: 65 [2018-12-24 14:15:53,722 INFO L226 Difference]: Without dead ends: 63 [2018-12-24 14:15:53,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 14:15:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-24 14:15:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-24 14:15:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-24 14:15:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-24 14:15:53,726 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-24 14:15:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:53,726 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-24 14:15:53,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-24 14:15:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-24 14:15:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-24 14:15:53,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:53,727 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-24 14:15:53,727 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-24 14:15:53,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:53,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:53,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:56,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:56,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:56,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:56,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:56,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:56,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:56,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:56,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:57,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-24 14:15:57,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:57,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:57,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:01,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:01,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-24 14:16:01,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:01,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 14:16:01,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 14:16:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:16:01,380 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-24 14:16:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:01,454 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-24 14:16:01,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 14:16:01,454 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-24 14:16:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:01,455 INFO L225 Difference]: With dead ends: 66 [2018-12-24 14:16:01,455 INFO L226 Difference]: Without dead ends: 64 [2018-12-24 14:16:01,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:16:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-24 14:16:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-24 14:16:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-24 14:16:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-24 14:16:01,458 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-24 14:16:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:01,459 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-24 14:16:01,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 14:16:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-24 14:16:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-24 14:16:01,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:01,459 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-24 14:16:01,459 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:01,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-24 14:16:01,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:01,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:01,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:01,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:01,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:03,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:03,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:03,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:03,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:03,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:03,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:03,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:16:03,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:16:03,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:16:03,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:03,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:03,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:07,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:07,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-24 14:16:07,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:07,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-24 14:16:07,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-24 14:16:07,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 14:16:07,265 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-24 14:16:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:07,378 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-24 14:16:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 14:16:07,378 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-24 14:16:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:07,379 INFO L225 Difference]: With dead ends: 67 [2018-12-24 14:16:07,379 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 14:16:07,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 14:16:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 14:16:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-24 14:16:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-24 14:16:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-24 14:16:07,381 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-24 14:16:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:07,382 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-24 14:16:07,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-24 14:16:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-24 14:16:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-24 14:16:07,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:07,382 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-24 14:16:07,382 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-24 14:16:07,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:07,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:07,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:07,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:07,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:08,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:08,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:08,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:08,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:08,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:08,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:08,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:08,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:16:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:08,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:08,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:13,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:13,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-24 14:16:13,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:13,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 14:16:13,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 14:16:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 14:16:13,242 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-24 14:16:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:13,385 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-24 14:16:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 14:16:13,386 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-24 14:16:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:13,386 INFO L225 Difference]: With dead ends: 68 [2018-12-24 14:16:13,387 INFO L226 Difference]: Without dead ends: 66 [2018-12-24 14:16:13,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 14:16:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-24 14:16:13,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-24 14:16:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-24 14:16:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-24 14:16:13,389 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-24 14:16:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:13,390 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-24 14:16:13,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 14:16:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-24 14:16:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-24 14:16:13,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:13,390 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-24 14:16:13,390 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:13,390 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-24 14:16:13,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:13,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:13,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:13,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:13,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:14,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:14,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:14,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:14,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:14,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:14,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:14,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:16:14,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:16:15,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-24 14:16:15,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:15,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:15,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:19,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:19,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-24 14:16:19,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:19,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-24 14:16:19,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-24 14:16:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:16:19,632 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-24 14:16:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:19,751 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-24 14:16:19,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 14:16:19,751 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-24 14:16:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:19,752 INFO L225 Difference]: With dead ends: 69 [2018-12-24 14:16:19,752 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 14:16:19,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:16:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 14:16:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-24 14:16:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 14:16:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-24 14:16:19,756 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-24 14:16:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:19,756 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-24 14:16:19,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-24 14:16:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-24 14:16:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-24 14:16:19,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:19,757 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-24 14:16:19,757 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:19,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-24 14:16:19,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:19,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:19,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:22,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:22,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:22,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:22,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:22,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:22,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:22,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:16:22,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:16:22,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:16:22,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:22,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:22,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:27,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:27,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-24 14:16:27,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:27,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 14:16:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 14:16:27,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 14:16:27,011 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-24 14:16:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:27,129 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-24 14:16:27,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 14:16:27,135 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-24 14:16:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:27,136 INFO L225 Difference]: With dead ends: 70 [2018-12-24 14:16:27,136 INFO L226 Difference]: Without dead ends: 68 [2018-12-24 14:16:27,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 14:16:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-24 14:16:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-24 14:16:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-24 14:16:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-24 14:16:27,140 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-24 14:16:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:27,140 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-24 14:16:27,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 14:16:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-24 14:16:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-24 14:16:27,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:27,142 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-24 14:16:27,142 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:27,142 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-24 14:16:27,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:27,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:27,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:28,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:28,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:28,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:28,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:28,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:28,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:28,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:28,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:16:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:28,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:28,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:33,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:33,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-24 14:16:33,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:33,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-24 14:16:33,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-24 14:16:33,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 14:16:33,546 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-24 14:16:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:33,635 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-24 14:16:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 14:16:33,635 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-24 14:16:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:33,636 INFO L225 Difference]: With dead ends: 71 [2018-12-24 14:16:33,636 INFO L226 Difference]: Without dead ends: 69 [2018-12-24 14:16:33,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 14:16:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-24 14:16:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-24 14:16:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 14:16:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-24 14:16:33,640 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-24 14:16:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:33,640 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-24 14:16:33,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-24 14:16:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-24 14:16:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-24 14:16:33,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:33,641 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-24 14:16:33,642 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:33,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:33,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-24 14:16:33,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:33,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:33,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:33,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:33,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:35,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:35,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:35,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:35,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:35,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:35,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:35,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:16:35,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:16:35,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-24 14:16:35,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:35,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:35,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:40,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:40,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-24 14:16:40,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:40,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 14:16:40,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 14:16:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:16:40,737 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-24 14:16:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:40,859 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-24 14:16:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 14:16:40,860 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-24 14:16:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:40,860 INFO L225 Difference]: With dead ends: 72 [2018-12-24 14:16:40,860 INFO L226 Difference]: Without dead ends: 70 [2018-12-24 14:16:40,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:16:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-24 14:16:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-24 14:16:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-24 14:16:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-24 14:16:40,864 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-24 14:16:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:40,865 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-24 14:16:40,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 14:16:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-24 14:16:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-24 14:16:40,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:40,865 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-24 14:16:40,866 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:40,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:40,866 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-24 14:16:40,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:40,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:40,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:40,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:40,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:43,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:43,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:43,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:43,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:43,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:43,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:43,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:16:43,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:16:43,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:16:43,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:43,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:43,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:48,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:48,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-24 14:16:48,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:48,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-24 14:16:48,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-24 14:16:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 14:16:48,686 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-24 14:16:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:49,056 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-24 14:16:49,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 14:16:49,057 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-24 14:16:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:49,057 INFO L225 Difference]: With dead ends: 73 [2018-12-24 14:16:49,057 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 14:16:49,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 14:16:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 14:16:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-24 14:16:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 14:16:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-24 14:16:49,060 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-24 14:16:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:49,060 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-24 14:16:49,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-24 14:16:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-24 14:16:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-24 14:16:49,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:49,061 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-24 14:16:49,061 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-24 14:16:49,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:49,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:49,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:50,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:50,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:50,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:50,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:50,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:50,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:50,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:50,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:16:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:50,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:50,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:56,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:56,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-24 14:16:56,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:56,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 14:16:56,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 14:16:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 14:16:56,080 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-24 14:16:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:56,194 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-24 14:16:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 14:16:56,194 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-24 14:16:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:56,195 INFO L225 Difference]: With dead ends: 74 [2018-12-24 14:16:56,195 INFO L226 Difference]: Without dead ends: 72 [2018-12-24 14:16:56,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 14:16:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-24 14:16:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-24 14:16:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-24 14:16:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-24 14:16:56,199 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-24 14:16:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:56,199 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-24 14:16:56,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 14:16:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-24 14:16:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-24 14:16:56,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:56,199 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-24 14:16:56,200 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-24 14:16:56,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:56,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:56,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:56,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:58,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:58,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:58,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:58,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:58,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:58,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:58,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:16:58,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:16:58,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-24 14:16:58,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:58,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:58,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:03,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:03,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-24 14:17:03,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:03,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-24 14:17:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-24 14:17:03,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:17:03,943 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-24 14:17:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:04,164 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-24 14:17:04,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 14:17:04,164 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-24 14:17:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:04,165 INFO L225 Difference]: With dead ends: 75 [2018-12-24 14:17:04,165 INFO L226 Difference]: Without dead ends: 73 [2018-12-24 14:17:04,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:17:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-24 14:17:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-24 14:17:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 14:17:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-24 14:17:04,168 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-24 14:17:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:04,168 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-24 14:17:04,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-24 14:17:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-24 14:17:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 14:17:04,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:04,169 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-24 14:17:04,169 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-24 14:17:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:04,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:04,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:05,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:05,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:05,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:05,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:05,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:05,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:05,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:05,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:05,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:05,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:06,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:06,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:11,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-24 14:17:11,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:11,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 14:17:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 14:17:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 14:17:11,397 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-24 14:17:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:11,619 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-24 14:17:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 14:17:11,620 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-24 14:17:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:11,621 INFO L225 Difference]: With dead ends: 76 [2018-12-24 14:17:11,621 INFO L226 Difference]: Without dead ends: 74 [2018-12-24 14:17:11,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 14:17:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-24 14:17:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-24 14:17:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-24 14:17:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-24 14:17:11,625 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-24 14:17:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:11,625 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-24 14:17:11,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 14:17:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-24 14:17:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-24 14:17:11,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:11,626 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-24 14:17:11,626 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-24 14:17:11,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:11,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:11,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:11,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:13,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:13,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:13,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:13,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:13,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:13,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:13,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:13,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:13,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:13,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:19,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:19,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-24 14:17:19,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:19,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-24 14:17:19,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-24 14:17:19,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 14:17:19,259 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-24 14:17:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:19,437 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-24 14:17:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 14:17:19,438 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-24 14:17:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:19,438 INFO L225 Difference]: With dead ends: 77 [2018-12-24 14:17:19,439 INFO L226 Difference]: Without dead ends: 75 [2018-12-24 14:17:19,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 14:17:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-24 14:17:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-24 14:17:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 14:17:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-24 14:17:19,442 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-24 14:17:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:19,443 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-24 14:17:19,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-24 14:17:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-24 14:17:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-24 14:17:19,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:19,444 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-24 14:17:19,444 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-24 14:17:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:19,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:21,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:21,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:21,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:21,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:21,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:21,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:21,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:22,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-24 14:17:22,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:22,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:22,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:27,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:27,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-24 14:17:27,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:27,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 14:17:27,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 14:17:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:17:27,949 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-24 14:17:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:28,104 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-24 14:17:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 14:17:28,104 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-24 14:17:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:28,105 INFO L225 Difference]: With dead ends: 78 [2018-12-24 14:17:28,105 INFO L226 Difference]: Without dead ends: 76 [2018-12-24 14:17:28,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:17:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-24 14:17:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-24 14:17:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 14:17:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-24 14:17:28,109 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-24 14:17:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:28,109 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-24 14:17:28,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 14:17:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-24 14:17:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-24 14:17:28,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:28,110 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-24 14:17:28,110 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-24 14:17:28,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:28,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:28,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:30,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:30,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:30,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:30,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:30,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:30,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:30,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:30,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:30,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:30,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:30,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:30,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:36,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-24 14:17:36,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:36,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-24 14:17:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-24 14:17:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 14:17:36,135 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-24 14:17:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:36,302 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-24 14:17:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 14:17:36,302 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-24 14:17:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:36,303 INFO L225 Difference]: With dead ends: 79 [2018-12-24 14:17:36,303 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 14:17:36,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 14:17:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 14:17:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-24 14:17:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 14:17:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-24 14:17:36,306 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-24 14:17:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:36,307 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-24 14:17:36,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-24 14:17:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-24 14:17:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-24 14:17:36,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:36,307 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-24 14:17:36,308 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-24 14:17:36,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:36,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:36,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:38,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:38,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:38,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:38,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:38,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:38,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:38,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:38,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:38,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:38,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:45,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:45,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-24 14:17:45,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:45,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 14:17:45,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 14:17:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 14:17:45,018 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-24 14:17:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:45,188 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-24 14:17:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 14:17:45,188 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-24 14:17:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:45,189 INFO L225 Difference]: With dead ends: 80 [2018-12-24 14:17:45,189 INFO L226 Difference]: Without dead ends: 78 [2018-12-24 14:17:45,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 14:17:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-24 14:17:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-24 14:17:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-24 14:17:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-24 14:17:45,210 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-24 14:17:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:45,210 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-24 14:17:45,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 14:17:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-24 14:17:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-24 14:17:45,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:45,211 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-24 14:17:45,211 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-24 14:17:45,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:45,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:45,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:47,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:47,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:47,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:47,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:47,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:47,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:47,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:47,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:47,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-24 14:17:47,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:47,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:47,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:54,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:54,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-24 14:17:54,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:54,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-24 14:17:54,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-24 14:17:54,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:17:54,036 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-24 14:17:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:54,149 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-24 14:17:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 14:17:54,149 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-24 14:17:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:54,150 INFO L225 Difference]: With dead ends: 81 [2018-12-24 14:17:54,150 INFO L226 Difference]: Without dead ends: 79 [2018-12-24 14:17:54,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:17:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-24 14:17:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-24 14:17:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 14:17:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-24 14:17:54,154 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-24 14:17:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:54,155 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-24 14:17:54,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-24 14:17:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-24 14:17:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-24 14:17:54,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:54,156 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-24 14:17:54,156 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-24 14:17:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:54,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:54,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:56,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:56,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:56,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:56,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:56,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:56,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:56,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:56,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:56,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:56,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:56,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:02,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:02,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-24 14:18:02,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:02,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 14:18:02,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 14:18:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:18:02,681 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-24 14:18:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:02,843 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-24 14:18:02,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 14:18:02,843 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-24 14:18:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:02,844 INFO L225 Difference]: With dead ends: 82 [2018-12-24 14:18:02,844 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 14:18:02,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:18:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 14:18:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-24 14:18:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-24 14:18:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-24 14:18:02,847 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-24 14:18:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:02,848 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-24 14:18:02,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 14:18:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-24 14:18:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-24 14:18:02,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:02,849 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-24 14:18:02,849 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-24 14:18:02,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:02,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:02,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:02,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:02,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:05,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:05,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:05,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:05,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:05,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:05,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:05,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:05,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:05,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:05,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:12,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:12,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-24 14:18:12,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:12,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-24 14:18:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-24 14:18:12,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:18:12,021 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-24 14:18:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:12,920 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-24 14:18:12,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 14:18:12,920 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-24 14:18:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:12,921 INFO L225 Difference]: With dead ends: 83 [2018-12-24 14:18:12,921 INFO L226 Difference]: Without dead ends: 81 [2018-12-24 14:18:12,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:18:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-24 14:18:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-24 14:18:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 14:18:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-24 14:18:12,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-24 14:18:12,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:12,924 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-24 14:18:12,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-24 14:18:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-24 14:18:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 14:18:12,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:12,925 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-24 14:18:12,925 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-24 14:18:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:12,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:12,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:12,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:12,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:15,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:15,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:15,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:15,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:15,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:15,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:15,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:15,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:16,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-24 14:18:16,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:16,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:16,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:24,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:24,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-24 14:18:24,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:24,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 14:18:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 14:18:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:18:24,117 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-24 14:18:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:24,762 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-24 14:18:24,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 14:18:24,762 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-24 14:18:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:24,763 INFO L225 Difference]: With dead ends: 84 [2018-12-24 14:18:24,763 INFO L226 Difference]: Without dead ends: 82 [2018-12-24 14:18:24,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:18:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-24 14:18:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-24 14:18:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-24 14:18:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-24 14:18:24,767 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-24 14:18:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:24,767 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-24 14:18:24,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 14:18:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-24 14:18:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-24 14:18:24,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:24,768 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-24 14:18:24,768 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:24,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-24 14:18:24,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:24,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:24,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:27,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:27,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:27,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:27,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:27,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:27,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:27,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:27,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:27,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:27,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:27,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:27,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:34,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:34,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-24 14:18:34,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:34,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-24 14:18:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-24 14:18:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:18:34,684 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-24 14:18:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:34,832 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-24 14:18:34,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 14:18:34,832 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-24 14:18:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:34,833 INFO L225 Difference]: With dead ends: 85 [2018-12-24 14:18:34,833 INFO L226 Difference]: Without dead ends: 83 [2018-12-24 14:18:34,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:18:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-24 14:18:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-24 14:18:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-24 14:18:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-24 14:18:34,836 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-24 14:18:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:34,836 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-24 14:18:34,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-24 14:18:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-24 14:18:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-24 14:18:34,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:34,837 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-24 14:18:34,837 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-24 14:18:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:34,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:34,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:37,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:37,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:37,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:37,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:37,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:37,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:37,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:37,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:37,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:44,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:44,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-24 14:18:44,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:44,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 14:18:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 14:18:44,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:18:44,430 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-24 14:18:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:44,549 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-24 14:18:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 14:18:44,549 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-24 14:18:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:44,550 INFO L225 Difference]: With dead ends: 86 [2018-12-24 14:18:44,550 INFO L226 Difference]: Without dead ends: 84 [2018-12-24 14:18:44,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:18:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-24 14:18:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-24 14:18:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-24 14:18:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-24 14:18:44,554 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-24 14:18:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:44,554 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-24 14:18:44,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 14:18:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-24 14:18:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-24 14:18:44,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:44,555 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-24 14:18:44,555 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-24 14:18:44,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:44,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:44,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:47,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:47,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:47,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:47,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:47,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:47,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:47,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:47,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:48,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-24 14:18:48,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:48,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:48,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:55,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:55,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-24 14:18:55,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:55,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-24 14:18:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-24 14:18:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:18:55,767 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-24 14:18:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:55,956 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-24 14:18:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 14:18:55,956 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-24 14:18:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:55,957 INFO L225 Difference]: With dead ends: 87 [2018-12-24 14:18:55,957 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 14:18:55,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:18:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 14:18:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-24 14:18:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 14:18:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-24 14:18:55,960 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-24 14:18:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:55,960 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-24 14:18:55,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-24 14:18:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-24 14:18:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 14:18:55,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:55,961 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-24 14:18:55,961 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-24 14:18:55,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:55,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:55,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:58,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:58,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:58,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:58,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:58,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:58,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:58,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:58,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:58,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:58,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:58,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:58,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:05,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-24 14:19:05,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:05,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 14:19:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 14:19:05,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:19:05,987 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-24 14:19:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:06,164 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-24 14:19:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 14:19:06,164 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-24 14:19:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:06,165 INFO L225 Difference]: With dead ends: 88 [2018-12-24 14:19:06,165 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 14:19:06,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:19:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 14:19:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-24 14:19:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-24 14:19:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-24 14:19:06,168 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-24 14:19:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:06,169 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-24 14:19:06,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 14:19:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-24 14:19:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-24 14:19:06,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:06,169 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-24 14:19:06,169 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-24 14:19:06,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:06,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:06,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:08,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:08,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:08,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:08,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:08,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:08,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:08,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:08,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:08,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:08,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:16,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:16,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-24 14:19:16,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:16,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-24 14:19:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-24 14:19:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:19:16,688 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-24 14:19:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:16,838 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-24 14:19:16,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 14:19:16,838 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-24 14:19:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:16,838 INFO L225 Difference]: With dead ends: 89 [2018-12-24 14:19:16,839 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 14:19:16,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:19:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 14:19:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-24 14:19:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-24 14:19:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-24 14:19:16,841 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-24 14:19:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:16,841 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-24 14:19:16,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-24 14:19:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-24 14:19:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-24 14:19:16,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:16,842 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-24 14:19:16,842 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-24 14:19:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:16,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:16,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:19,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:19,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:19,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:19,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:19,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:19,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:19,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:19,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:20,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-24 14:19:20,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:20,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:20,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:28,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:28,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-24 14:19:28,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:28,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 14:19:28,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 14:19:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:19:28,078 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-24 14:19:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:28,216 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-24 14:19:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 14:19:28,216 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-24 14:19:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:28,217 INFO L225 Difference]: With dead ends: 90 [2018-12-24 14:19:28,217 INFO L226 Difference]: Without dead ends: 88 [2018-12-24 14:19:28,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:19:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-24 14:19:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-24 14:19:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-24 14:19:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-24 14:19:28,219 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-24 14:19:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:28,220 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-24 14:19:28,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 14:19:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-24 14:19:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-24 14:19:28,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:28,220 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-24 14:19:28,220 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-24 14:19:28,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:28,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:28,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:28,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:31,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:31,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:31,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:31,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:31,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:31,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:31,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:31,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:31,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:31,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:31,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:38,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:38,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-24 14:19:38,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:38,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-24 14:19:38,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-24 14:19:38,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:19:38,854 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-24 14:19:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:39,013 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-24 14:19:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 14:19:39,013 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-24 14:19:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:39,014 INFO L225 Difference]: With dead ends: 91 [2018-12-24 14:19:39,014 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 14:19:39,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:19:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 14:19:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-24 14:19:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-24 14:19:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-24 14:19:39,017 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-24 14:19:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:39,017 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-24 14:19:39,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-24 14:19:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-24 14:19:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-24 14:19:39,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:39,018 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-24 14:19:39,019 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:39,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:39,019 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-24 14:19:39,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:39,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:39,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:39,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:39,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:41,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:41,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:41,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:41,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:41,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:41,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:41,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:41,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:41,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:42,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:49,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:49,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-24 14:19:49,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:49,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 14:19:49,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 14:19:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:19:49,878 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-24 14:19:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:50,291 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-24 14:19:50,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 14:19:50,291 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-24 14:19:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:50,292 INFO L225 Difference]: With dead ends: 92 [2018-12-24 14:19:50,292 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 14:19:50,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:19:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 14:19:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-24 14:19:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-24 14:19:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-24 14:19:50,295 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-24 14:19:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:50,295 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-24 14:19:50,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 14:19:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-24 14:19:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-24 14:19:50,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:50,296 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-24 14:19:50,296 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:50,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:50,296 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-24 14:19:50,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:50,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:50,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:53,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:53,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:53,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:53,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:53,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:53,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:53,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:53,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:54,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-24 14:19:54,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:54,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:54,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:02,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:02,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-24 14:20:02,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:02,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-24 14:20:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-24 14:20:02,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:20:02,572 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-24 14:20:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:02,796 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-24 14:20:02,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 14:20:02,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-24 14:20:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:02,797 INFO L225 Difference]: With dead ends: 93 [2018-12-24 14:20:02,797 INFO L226 Difference]: Without dead ends: 91 [2018-12-24 14:20:02,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:20:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-24 14:20:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-24 14:20:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 14:20:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-24 14:20:02,800 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-24 14:20:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:02,800 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-24 14:20:02,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-24 14:20:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-24 14:20:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 14:20:02,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:02,800 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-24 14:20:02,801 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-24 14:20:02,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:02,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:02,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:05,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:05,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:05,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:05,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:05,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:05,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:05,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:05,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:05,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:05,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:05,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:05,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:14,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:14,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-24 14:20:14,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:14,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 14:20:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 14:20:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:20:14,163 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-24 14:20:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:14,323 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-24 14:20:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 14:20:14,323 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-24 14:20:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:14,324 INFO L225 Difference]: With dead ends: 94 [2018-12-24 14:20:14,324 INFO L226 Difference]: Without dead ends: 92 [2018-12-24 14:20:14,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:20:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-24 14:20:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-24 14:20:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-24 14:20:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-24 14:20:14,327 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-24 14:20:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:14,327 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-24 14:20:14,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 14:20:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-24 14:20:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-24 14:20:14,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:14,328 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-24 14:20:14,328 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:14,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-24 14:20:14,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:14,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:14,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:17,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:17,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:17,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:17,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:17,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:17,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:17,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:17,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:17,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:17,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:26,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:26,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-24 14:20:26,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:26,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-24 14:20:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-24 14:20:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:20:26,026 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-24 14:20:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:26,327 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-24 14:20:26,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 14:20:26,327 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-24 14:20:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:26,328 INFO L225 Difference]: With dead ends: 95 [2018-12-24 14:20:26,328 INFO L226 Difference]: Without dead ends: 93 [2018-12-24 14:20:26,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:20:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-24 14:20:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-24 14:20:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 14:20:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-24 14:20:26,331 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-24 14:20:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:26,331 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-24 14:20:26,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-24 14:20:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-24 14:20:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-24 14:20:26,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:26,332 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-24 14:20:26,332 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-24 14:20:26,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:26,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:26,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:26,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:29,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:29,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:29,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:29,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:29,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:29,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:29,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:30,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-24 14:20:30,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:30,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:30,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:39,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:39,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-24 14:20:39,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:39,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 14:20:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 14:20:39,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:20:39,583 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-24 14:20:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:39,733 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-24 14:20:39,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 14:20:39,734 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-24 14:20:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:39,735 INFO L225 Difference]: With dead ends: 96 [2018-12-24 14:20:39,735 INFO L226 Difference]: Without dead ends: 94 [2018-12-24 14:20:39,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:20:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-24 14:20:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-24 14:20:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-24 14:20:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-24 14:20:39,739 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-24 14:20:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:39,739 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-24 14:20:39,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 14:20:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-24 14:20:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-24 14:20:39,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:39,739 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-24 14:20:39,739 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-24 14:20:39,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:39,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:39,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:39,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:39,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:42,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:42,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:42,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:42,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:42,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:42,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:42,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:42,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:42,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:42,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:42,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:43,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:52,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:52,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-24 14:20:52,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:52,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-24 14:20:52,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-24 14:20:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:20:52,123 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-24 14:20:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:52,358 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-24 14:20:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 14:20:52,358 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-24 14:20:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:52,359 INFO L225 Difference]: With dead ends: 97 [2018-12-24 14:20:52,359 INFO L226 Difference]: Without dead ends: 95 [2018-12-24 14:20:52,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:20:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-24 14:20:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-24 14:20:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-24 14:20:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-24 14:20:52,362 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-24 14:20:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:52,363 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-24 14:20:52,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-24 14:20:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-24 14:20:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-24 14:20:52,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:52,364 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-24 14:20:52,364 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:52,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-24 14:20:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:52,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:52,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:55,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:55,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:55,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:55,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:55,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:55,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:55,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:55,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:55,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:04,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:04,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-24 14:21:04,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:04,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 14:21:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 14:21:04,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:21:04,688 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-24 14:21:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:04,921 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-24 14:21:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 14:21:04,921 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-24 14:21:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:04,922 INFO L225 Difference]: With dead ends: 98 [2018-12-24 14:21:04,922 INFO L226 Difference]: Without dead ends: 96 [2018-12-24 14:21:04,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:21:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-24 14:21:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-24 14:21:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-24 14:21:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-24 14:21:04,924 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-24 14:21:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:04,925 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-24 14:21:04,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 14:21:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-24 14:21:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-24 14:21:04,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:04,925 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-24 14:21:04,925 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-24 14:21:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:04,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:04,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:08,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:08,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:08,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:08,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:08,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:08,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:08,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:21:08,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:09,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-24 14:21:09,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:09,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:09,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:19,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:19,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-24 14:21:19,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:19,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-24 14:21:19,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-24 14:21:19,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:21:19,150 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-24 14:21:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:19,306 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-24 14:21:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 14:21:19,306 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-24 14:21:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:19,306 INFO L225 Difference]: With dead ends: 99 [2018-12-24 14:21:19,306 INFO L226 Difference]: Without dead ends: 97 [2018-12-24 14:21:19,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:21:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-24 14:21:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-24 14:21:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 14:21:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-24 14:21:19,310 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-24 14:21:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:19,310 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-24 14:21:19,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-24 14:21:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-24 14:21:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 14:21:19,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:19,311 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-24 14:21:19,311 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:19,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:19,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-24 14:21:19,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:19,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:19,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:22,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:22,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:22,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:22,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:22,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:22,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:22,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:21:22,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:21:22,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:21:22,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:22,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:22,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:32,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:32,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-24 14:21:32,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:32,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 14:21:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 14:21:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:21:32,101 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-24 14:21:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:32,257 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-24 14:21:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 14:21:32,258 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-24 14:21:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:32,258 INFO L225 Difference]: With dead ends: 100 [2018-12-24 14:21:32,259 INFO L226 Difference]: Without dead ends: 98 [2018-12-24 14:21:32,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:21:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-24 14:21:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-24 14:21:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-24 14:21:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-24 14:21:32,262 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-24 14:21:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:32,262 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-24 14:21:32,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 14:21:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-24 14:21:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-24 14:21:32,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:32,263 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-24 14:21:32,263 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:32,263 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-24 14:21:32,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:32,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:32,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:32,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:32,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:35,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:35,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:35,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:35,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:35,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:35,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:35,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:35,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:21:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:35,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:35,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-24 14:21:45,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:45,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-24 14:21:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-24 14:21:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:21:45,679 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-24 14:21:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:45,835 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-24 14:21:45,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 14:21:45,835 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-24 14:21:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:45,836 INFO L225 Difference]: With dead ends: 101 [2018-12-24 14:21:45,836 INFO L226 Difference]: Without dead ends: 99 [2018-12-24 14:21:45,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:21:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-24 14:21:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-24 14:21:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-24 14:21:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-24 14:21:45,841 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-24 14:21:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:45,841 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-24 14:21:45,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-24 14:21:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-24 14:21:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-24 14:21:45,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:45,842 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-24 14:21:45,842 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-24 14:21:45,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:45,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:49,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:49,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:49,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:49,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:49,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:49,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:49,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:21:49,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:51,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-24 14:21:51,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:51,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:51,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:01,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:01,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-24 14:22:01,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:01,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 14:22:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 14:22:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:22:01,268 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-24 14:22:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:01,428 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-24 14:22:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 14:22:01,429 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-24 14:22:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:01,430 INFO L225 Difference]: With dead ends: 102 [2018-12-24 14:22:01,430 INFO L226 Difference]: Without dead ends: 100 [2018-12-24 14:22:01,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:22:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-24 14:22:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-24 14:22:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-24 14:22:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-24 14:22:01,433 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-24 14:22:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:01,433 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-24 14:22:01,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 14:22:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-24 14:22:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-24 14:22:01,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:01,434 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-24 14:22:01,434 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:01,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-24 14:22:01,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:01,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:01,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:05,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:05,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:05,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:05,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:05,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:05,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:22:05,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:22:05,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:22:05,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:05,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:05,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:15,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-24 14:22:15,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:15,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-24 14:22:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-24 14:22:15,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:22:15,406 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-24 14:22:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:15,632 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-24 14:22:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 14:22:15,633 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-24 14:22:15,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:15,633 INFO L225 Difference]: With dead ends: 103 [2018-12-24 14:22:15,633 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 14:22:15,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:22:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 14:22:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-24 14:22:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 14:22:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-24 14:22:15,637 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-24 14:22:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:15,637 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-24 14:22:15,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-24 14:22:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-24 14:22:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 14:22:15,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:15,638 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-24 14:22:15,638 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-24 14:22:15,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:15,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:15,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:19,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:19,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:19,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:19,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:19,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:19,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:19,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:19,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:22:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:19,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:19,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:29,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:29,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-24 14:22:29,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:29,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 14:22:29,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 14:22:29,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:22:29,784 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-24 14:22:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:30,090 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-24 14:22:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 14:22:30,090 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-24 14:22:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:30,091 INFO L225 Difference]: With dead ends: 104 [2018-12-24 14:22:30,091 INFO L226 Difference]: Without dead ends: 102 [2018-12-24 14:22:30,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:22:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-24 14:22:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-24 14:22:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-24 14:22:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-24 14:22:30,095 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-24 14:22:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:30,095 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-24 14:22:30,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 14:22:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-24 14:22:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-24 14:22:30,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:30,096 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-24 14:22:30,096 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-24 14:22:30,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:30,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:30,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:30,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:33,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:33,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:33,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:33,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:33,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:33,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:33,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:22:33,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:22:35,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-24 14:22:35,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:35,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:35,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:46,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:46,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-24 14:22:46,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:46,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-24 14:22:46,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-24 14:22:46,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:22:46,213 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-24 14:22:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:46,461 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-24 14:22:46,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 14:22:46,461 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-24 14:22:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:46,462 INFO L225 Difference]: With dead ends: 105 [2018-12-24 14:22:46,462 INFO L226 Difference]: Without dead ends: 103 [2018-12-24 14:22:46,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:22:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-24 14:22:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-24 14:22:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 14:22:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-24 14:22:46,466 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-24 14:22:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:46,466 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-24 14:22:46,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-24 14:22:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-24 14:22:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-24 14:22:46,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:46,467 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-24 14:22:46,467 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-24 14:22:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:46,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:46,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:50,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:50,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:50,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:50,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:50,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:50,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:50,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:22:50,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:22:50,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:22:50,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:50,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:50,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:01,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:01,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-24 14:23:01,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:01,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 14:23:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 14:23:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:23:01,292 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-24 14:23:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:01,566 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-24 14:23:01,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-24 14:23:01,567 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-24 14:23:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:01,568 INFO L225 Difference]: With dead ends: 106 [2018-12-24 14:23:01,568 INFO L226 Difference]: Without dead ends: 104 [2018-12-24 14:23:01,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:23:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-24 14:23:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-24 14:23:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-24 14:23:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-24 14:23:01,571 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-24 14:23:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:01,571 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-24 14:23:01,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 14:23:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-24 14:23:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-24 14:23:01,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:01,572 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-24 14:23:01,572 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-24 14:23:01,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:01,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:01,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:05,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:05,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:05,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:05,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:05,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:05,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:05,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:05,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:23:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:05,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:05,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:16,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:16,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-24 14:23:16,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:16,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-24 14:23:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-24 14:23:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 14:23:16,737 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-24 14:23:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:16,915 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-24 14:23:16,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 14:23:16,915 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-24 14:23:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:16,917 INFO L225 Difference]: With dead ends: 107 [2018-12-24 14:23:16,917 INFO L226 Difference]: Without dead ends: 105 [2018-12-24 14:23:16,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 14:23:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-24 14:23:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-24 14:23:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-24 14:23:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-24 14:23:16,922 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-24 14:23:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:16,922 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-24 14:23:16,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-24 14:23:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-24 14:23:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-24 14:23:16,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:16,923 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-24 14:23:16,923 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:16,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-24 14:23:16,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:16,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:16,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:20,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:20,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:20,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:20,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:20,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:20,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:20,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:23:20,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:23:23,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-24 14:23:23,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:23,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:23,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-24 14:23:34,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:34,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 14:23:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 14:23:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 14:23:34,422 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-24 14:23:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:34,759 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-24 14:23:34,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-24 14:23:34,759 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-24 14:23:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:34,760 INFO L225 Difference]: With dead ends: 108 [2018-12-24 14:23:34,760 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 14:23:34,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 14:23:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 14:23:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-24 14:23:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-24 14:23:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-24 14:23:34,765 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-24 14:23:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:34,765 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-24 14:23:34,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 14:23:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-24 14:23:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-24 14:23:34,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:34,766 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-24 14:23:34,766 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-24 14:23:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:34,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:34,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:38,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:38,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:38,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:38,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:38,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:38,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:38,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:23:38,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:23:38,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:23:38,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:38,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:38,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:50,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:50,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-24 14:23:50,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:50,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-24 14:23:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-24 14:23:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 14:23:50,351 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-24 14:23:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:50,646 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-24 14:23:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-24 14:23:50,647 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-24 14:23:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:50,647 INFO L225 Difference]: With dead ends: 109 [2018-12-24 14:23:50,648 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 14:23:50,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 14:23:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 14:23:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-24 14:23:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-24 14:23:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-24 14:23:50,652 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-24 14:23:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:50,652 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-24 14:23:50,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-24 14:23:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-24 14:23:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-24 14:23:50,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:50,653 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-24 14:23:50,654 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:50,654 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-24 14:23:50,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:50,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:50,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:50,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:50,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:54,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:54,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:54,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:54,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:54,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:54,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:54,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:54,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:23:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:54,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:54,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:06,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:06,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-24 14:24:06,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:06,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 14:24:06,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 14:24:06,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-24 14:24:06,889 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-24 14:24:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:07,127 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-24 14:24:07,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-24 14:24:07,132 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-24 14:24:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:07,133 INFO L225 Difference]: With dead ends: 110 [2018-12-24 14:24:07,133 INFO L226 Difference]: Without dead ends: 108 [2018-12-24 14:24:07,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-24 14:24:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-24 14:24:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-24 14:24:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-24 14:24:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-24 14:24:07,137 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-24 14:24:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:07,137 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-24 14:24:07,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 14:24:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-24 14:24:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-24 14:24:07,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:07,138 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-24 14:24:07,138 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:07,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-24 14:24:07,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:07,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:07,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:07,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:07,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:10,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:10,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:11,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:11,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:11,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:11,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:11,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:24:11,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:24:13,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-24 14:24:13,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:13,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:13,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:25,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:25,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-24 14:24:25,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:25,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-24 14:24:25,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-24 14:24:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-24 14:24:25,366 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-24 14:24:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:25,605 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-24 14:24:25,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-24 14:24:25,605 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-24 14:24:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:25,605 INFO L225 Difference]: With dead ends: 111 [2018-12-24 14:24:25,605 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 14:24:25,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-24 14:24:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 14:24:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-24 14:24:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 14:24:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-24 14:24:25,609 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-24 14:24:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:25,609 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-24 14:24:25,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-24 14:24:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-24 14:24:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 14:24:25,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:25,610 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-24 14:24:25,610 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-24 14:24:25,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:25,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:25,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:25,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:25,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:29,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:29,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:29,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:29,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:29,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:29,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:29,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:24:29,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:24:30,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:24:30,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:30,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:30,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:42,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:42,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-24 14:24:42,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:42,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-24 14:24:42,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-24 14:24:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-24 14:24:42,368 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-24 14:24:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:42,661 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-24 14:24:42,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-24 14:24:42,662 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-24 14:24:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:42,662 INFO L225 Difference]: With dead ends: 112 [2018-12-24 14:24:42,662 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 14:24:42,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-24 14:24:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 14:24:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-24 14:24:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-24 14:24:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-24 14:24:42,666 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-24 14:24:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:42,666 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-24 14:24:42,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-24 14:24:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-24 14:24:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-24 14:24:42,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:42,667 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-24 14:24:42,667 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-24 14:24:42,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:42,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:42,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:42,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:46,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:46,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:46,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:46,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:46,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:46,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:46,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:46,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:24:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:46,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:46,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:59,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:59,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-24 14:24:59,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:59,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-24 14:24:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-24 14:24:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-24 14:24:59,511 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-24 14:24:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:59,788 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-24 14:24:59,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-24 14:24:59,788 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-24 14:24:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:59,788 INFO L225 Difference]: With dead ends: 113 [2018-12-24 14:24:59,788 INFO L226 Difference]: Without dead ends: 111 [2018-12-24 14:24:59,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-24 14:24:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-24 14:24:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-24 14:24:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 14:24:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-24 14:24:59,792 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-24 14:24:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:59,792 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-24 14:24:59,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-24 14:24:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-24 14:24:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-24 14:24:59,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:59,793 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-24 14:24:59,793 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-24 14:24:59,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:59,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:04,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:04,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:04,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:04,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:04,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:04,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:04,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:25:04,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:25:06,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-24 14:25:06,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:06,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:06,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:19,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:19,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-24 14:25:19,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:19,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-24 14:25:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-24 14:25:19,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-24 14:25:19,815 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-24 14:25:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:20,163 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-24 14:25:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-24 14:25:20,164 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-24 14:25:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:20,164 INFO L225 Difference]: With dead ends: 114 [2018-12-24 14:25:20,164 INFO L226 Difference]: Without dead ends: 112 [2018-12-24 14:25:20,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-24 14:25:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-24 14:25:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-24 14:25:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-24 14:25:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-24 14:25:20,167 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-24 14:25:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:20,168 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-24 14:25:20,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-24 14:25:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-24 14:25:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-24 14:25:20,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:20,168 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-24 14:25:20,168 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-24 14:25:20,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:20,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:20,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:20,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:24,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:24,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:24,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:24,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:24,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:24,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:24,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:25:24,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:25:24,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:25:24,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:24,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:24,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:37,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:37,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-24 14:25:37,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:37,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-24 14:25:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-24 14:25:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-24 14:25:37,315 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-24 14:25:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:37,618 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-24 14:25:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-24 14:25:37,619 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-24 14:25:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:37,620 INFO L225 Difference]: With dead ends: 115 [2018-12-24 14:25:37,620 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 14:25:37,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-24 14:25:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 14:25:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-24 14:25:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 14:25:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-24 14:25:37,624 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-24 14:25:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:37,625 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-24 14:25:37,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-24 14:25:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-24 14:25:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-24 14:25:37,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:37,626 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-24 14:25:37,626 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:37,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-24 14:25:37,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:37,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:37,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:42,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:42,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:42,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:42,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:42,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:42,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:42,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:42,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:25:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:42,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:42,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:55,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:55,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-24 14:25:55,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:55,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 14:25:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 14:25:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-24 14:25:55,512 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-24 14:25:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:55,735 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-24 14:25:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-24 14:25:55,736 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-24 14:25:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:55,736 INFO L225 Difference]: With dead ends: 116 [2018-12-24 14:25:55,736 INFO L226 Difference]: Without dead ends: 114 [2018-12-24 14:25:55,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-24 14:25:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-24 14:25:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-24 14:25:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-24 14:25:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-24 14:25:55,740 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-24 14:25:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:55,740 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-24 14:25:55,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-24 14:25:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-24 14:25:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-24 14:25:55,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:55,741 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-24 14:25:55,741 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-24 14:25:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:55,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:55,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:55,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:00,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:00,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:00,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:00,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:00,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:00,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:00,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:00,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:03,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-24 14:26:03,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:03,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:03,348 INFO L316 TraceCheckSpWp]: Computing backward predicates...