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_camel.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:54,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:54,022 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:54,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:54,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:54,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:54,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:54,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:54,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:54,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:54,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:54,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:54,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:54,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:54,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:54,067 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:54,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:54,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:54,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:54,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:54,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:54,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:54,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:54,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:54,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:54,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:54,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:54,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:54,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:54,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:54,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:54,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:54,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:54,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:54,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:54,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:54,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:23:54,126 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:54,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:54,127 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:54,128 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:54,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:54,131 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:54,131 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:54,132 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:54,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:54,132 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:54,132 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:54,132 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:54,133 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:54,133 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:54,134 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:54,137 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:54,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:54,137 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:54,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:54,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:54,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:54,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:54,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:54,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:54,139 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:54,139 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:54,139 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:54,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:54,140 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:54,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:54,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:54,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:54,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:54,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:54,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:54,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:54,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:54,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:54,144 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:54,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:54,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:54,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:54,208 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:54,209 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:54,210 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-03-04 16:23:54,210 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-03-04 16:23:54,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:54,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:54,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:54,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:54,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:54,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,298 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:23:54,298 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:23:54,298 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:23:54,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:54,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:54,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:54,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:54,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:54,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:54,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:23:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:23:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-03-04 16:23:54,613 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:23:54,614 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-03-04 16:23:54,615 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:54 BoogieIcfgContainer [2019-03-04 16:23:54,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:54,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:54,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:54,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:54,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/2) ... [2019-03-04 16:23:54,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455a25bd and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:54, skipping insertion in model container [2019-03-04 16:23:54,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:54" (2/2) ... [2019-03-04 16:23:54,623 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-03-04 16:23:54,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:54,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:54,656 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:54,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:54,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:54,685 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:54,685 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:54,686 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:54,686 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:54,686 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:54,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:54,686 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:23:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:23:54,706 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:54,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:23:54,711 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-03-04 16:23:54,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:54,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:54,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:54,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:23:54,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:54,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:54,981 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-03-04 16:23:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,088 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-03-04 16:23:55,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:55,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:23:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,102 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:23:55,102 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:23:55,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:23:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-03-04 16:23:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:23:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:23:55,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-03-04 16:23:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,136 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:23:55,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:23:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:23:55,137 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,138 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:23:55,138 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2019-03-04 16:23:55,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:55,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:55,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:23:55,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:55,355 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:55,356 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,376 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,377 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:55,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:23:55,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:23:55,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:23:55,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:55,503 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-03-04 16:23:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,579 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:23:55,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:23:55,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-03-04 16:23:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,580 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:23:55,580 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:23:55,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:23:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-03-04 16:23:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:23:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-03-04 16:23:55,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-03-04 16:23:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,585 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-03-04 16:23:55,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:23:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-03-04 16:23:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:23:55,586 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,587 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-03-04 16:23:55,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,587 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2019-03-04 16:23:55,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:55,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:55,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:55,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:55,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:55,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:23:55,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:55,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:55,802 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,905 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,905 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:56,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:23:56,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:23:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:23:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:56,081 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-03-04 16:23:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,152 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-03-04 16:23:56,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:56,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-03-04 16:23:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,154 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:23:56,155 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:23:56,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:23:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:23:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:23:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-03-04 16:23:56,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-03-04 16:23:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,160 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-03-04 16:23:56,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:23:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-03-04 16:23:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-03-04 16:23:56,161 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,161 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-03-04 16:23:56,162 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2019-03-04 16:23:56,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:56,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:56,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:56,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:23:56,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:56,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:23:56,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:56,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:56,372 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,411 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,411 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:56,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:23:56,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:23:56,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:23:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:56,539 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-03-04 16:23:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,634 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-03-04 16:23:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:23:56,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-03-04 16:23:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,636 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:23:56,637 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:23:56,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:23:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-03-04 16:23:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:23:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-03-04 16:23:56,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-03-04 16:23:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,642 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-03-04 16:23:56,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:23:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-03-04 16:23:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-03-04 16:23:56,643 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,643 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-03-04 16:23:56,644 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2019-03-04 16:23:56,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:56,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:56,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:23:56,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:23:56,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:56,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:23:56,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:56,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:56,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,817 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,817 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:57,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:23:57,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:23:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:23:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:57,289 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-03-04 16:23:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:57,400 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-03-04 16:23:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:57,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-03-04 16:23:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:57,403 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:23:57,403 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:23:57,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:23:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-03-04 16:23:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:23:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-03-04 16:23:57,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-03-04 16:23:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:57,409 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-03-04 16:23:57,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:23:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-03-04 16:23:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-03-04 16:23:57,410 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:57,410 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-03-04 16:23:57,411 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2019-03-04 16:23:57,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:57,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:57,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:57,598 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:23:57,692 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-03-04 16:23:57,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:57,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 25 conjunts are in the unsatisfiable core [2019-03-04 16:23:57,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:57,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:57,736 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,750 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:57,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:23:57,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:23:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:23:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:57,883 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2019-03-04 16:23:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:57,963 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-03-04 16:23:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:23:57,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-03-04 16:23:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:57,964 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:23:57,965 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:23:57,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:23:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-03-04 16:23:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:23:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-03-04 16:23:57,971 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-03-04 16:23:57,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:57,972 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-03-04 16:23:57,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:23:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-03-04 16:23:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-03-04 16:23:57,973 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:57,973 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-03-04 16:23:57,973 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2019-03-04 16:23:57,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:57,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:57,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:57,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:57,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:58,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:58,134 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:23:58,149 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-03-04 16:23:58,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:58,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2019-03-04 16:23:58,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:58,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:58,160 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,172 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:58,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-03-04 16:23:58,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:23:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:23:58,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:23:58,382 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2019-03-04 16:23:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,452 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-03-04 16:23:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:23:58,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-03-04 16:23:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,454 INFO L225 Difference]: With dead ends: 27 [2019-03-04 16:23:58,454 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:23:58,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:23:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:23:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-03-04 16:23:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:23:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-03-04 16:23:58,459 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-03-04 16:23:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,459 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-03-04 16:23:58,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:23:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-03-04 16:23:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-03-04 16:23:58,460 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,460 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-03-04 16:23:58,460 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2019-03-04 16:23:58,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:58,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:58,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:23:58,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:58,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:58,613 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,623 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-03-04 16:23:58,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:23:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:23:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:23:58,820 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-03-04 16:23:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,899 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-03-04 16:23:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:23:58,900 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-03-04 16:23:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,901 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:23:58,902 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:23:58,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:23:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:23:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-03-04 16:23:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:23:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-03-04 16:23:58,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-03-04 16:23:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,908 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-03-04 16:23:58,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:23:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-03-04 16:23:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-03-04 16:23:58,909 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,909 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-03-04 16:23:58,910 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2019-03-04 16:23:58,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:59,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:59,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:59,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:59,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:59,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:23:59,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:59,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:59,149 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,162 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,162 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:59,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-03-04 16:23:59,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:23:59,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:23:59,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:59,427 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-03-04 16:23:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:59,849 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-03-04 16:23:59,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:23:59,849 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-03-04 16:23:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:59,851 INFO L225 Difference]: With dead ends: 33 [2019-03-04 16:23:59,851 INFO L226 Difference]: Without dead ends: 32 [2019-03-04 16:23:59,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-03-04 16:23:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-03-04 16:23:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:23:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-03-04 16:23:59,857 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-03-04 16:23:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:59,857 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-03-04 16:23:59,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:23:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-03-04 16:23:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:23:59,858 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,858 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-03-04 16:23:59,858 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2019-03-04 16:23:59,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:59,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:00,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:00,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:00,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-03-04 16:24:00,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:00,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 37 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,076 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:00,077 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,088 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,089 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:00,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-03-04 16:24:00,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-03-04 16:24:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-03-04 16:24:00,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:24:00,426 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2019-03-04 16:24:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:00,515 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-03-04 16:24:00,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:24:00,515 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-03-04 16:24:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:00,518 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:24:00,518 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:24:00,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:24:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:24:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-03-04 16:24:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:24:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-03-04 16:24:00,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-03-04 16:24:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:00,525 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-03-04 16:24:00,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-03-04 16:24:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-03-04 16:24:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-03-04 16:24:00,526 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:00,526 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-03-04 16:24:00,526 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2019-03-04 16:24:00,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:00,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:00,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:00,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:00,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:00,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,786 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:00,786 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,877 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,878 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:01,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-03-04 16:24:01,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-03-04 16:24:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-03-04 16:24:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:24:01,281 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2019-03-04 16:24:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,419 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-03-04 16:24:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:24:01,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-03-04 16:24:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,421 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:24:01,421 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:24:01,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:24:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:24:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-03-04 16:24:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:24:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-03-04 16:24:01,426 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-03-04 16:24:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,427 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-03-04 16:24:01,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-03-04 16:24:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-03-04 16:24:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-03-04 16:24:01,428 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,428 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-03-04 16:24:01,428 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2019-03-04 16:24:01,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:01,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:01,641 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:01,737 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-03-04 16:24:01,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:01,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 43 conjunts are in the unsatisfiable core [2019-03-04 16:24:01,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:01,747 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:01,748 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,793 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-03-04 16:24:02,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:24:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:24:02,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:02,070 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2019-03-04 16:24:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:02,171 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-03-04 16:24:02,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:24:02,171 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-03-04 16:24:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:02,172 INFO L225 Difference]: With dead ends: 42 [2019-03-04 16:24:02,173 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:24:02,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:24:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-03-04 16:24:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:24:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-03-04 16:24:02,179 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-03-04 16:24:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:02,179 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-03-04 16:24:02,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:24:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-03-04 16:24:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-03-04 16:24:02,180 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:02,181 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-03-04 16:24:02,181 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2019-03-04 16:24:02,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:02,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:02,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:02,678 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:02,705 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-03-04 16:24:02,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:02,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 46 conjunts are in the unsatisfiable core [2019-03-04 16:24:02,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:02,717 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,727 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,727 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2019-03-04 16:24:02,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-03-04 16:24:02,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-03-04 16:24:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2019-03-04 16:24:02,992 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2019-03-04 16:24:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,089 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-03-04 16:24:03,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:24:03,089 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-03-04 16:24:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,090 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:24:03,091 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:24:03,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2019-03-04 16:24:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:24:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-03-04 16:24:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:24:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-03-04 16:24:03,097 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-03-04 16:24:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,097 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-03-04 16:24:03,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-03-04 16:24:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-03-04 16:24:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-03-04 16:24:03,098 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,099 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-03-04 16:24:03,099 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:03,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,099 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2019-03-04 16:24:03,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:03,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:03,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 49 conjunts are in the unsatisfiable core [2019-03-04 16:24:03,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:03,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:03,428 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,484 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2019-03-04 16:24:03,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-03-04 16:24:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-03-04 16:24:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:24:03,728 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2019-03-04 16:24:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,856 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-03-04 16:24:03,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:24:03,857 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-03-04 16:24:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,858 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:24:03,858 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:24:03,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:24:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:24:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-03-04 16:24:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:24:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-03-04 16:24:03,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-03-04 16:24:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,864 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-03-04 16:24:03,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-03-04 16:24:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-03-04 16:24:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-03-04 16:24:03,865 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,866 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-03-04 16:24:03,866 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2019-03-04 16:24:03,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:04,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:04,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:04,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:04,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:04,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:24:04,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:04,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:04,187 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,197 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:04,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2019-03-04 16:24:04,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:24:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:24:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:24:04,552 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2019-03-04 16:24:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:04,767 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-03-04 16:24:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-03-04 16:24:04,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-03-04 16:24:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:04,768 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:24:04,768 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:24:04,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:24:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:24:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-03-04 16:24:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:24:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-03-04 16:24:04,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-03-04 16:24:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:04,778 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-03-04 16:24:04,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:24:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-03-04 16:24:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-03-04 16:24:04,779 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:04,779 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-03-04 16:24:04,779 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2019-03-04 16:24:04,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:04,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:05,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:05,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:05,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-03-04 16:24:05,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:05,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:24:05,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:05,139 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:05,140 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,146 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,147 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:05,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2019-03-04 16:24:05,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-03-04 16:24:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-03-04 16:24:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:24:05,392 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2019-03-04 16:24:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:05,628 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-03-04 16:24:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:24:05,629 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-03-04 16:24:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:05,630 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:24:05,630 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:24:05,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:24:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:24:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-03-04 16:24:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:24:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-03-04 16:24:05,636 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-03-04 16:24:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:05,636 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-03-04 16:24:05,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-03-04 16:24:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-03-04 16:24:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-03-04 16:24:05,637 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:05,637 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-03-04 16:24:05,638 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2019-03-04 16:24:05,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:06,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:06,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:06,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:06,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:06,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:24:06,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:06,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:06,364 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,372 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,373 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:06,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2019-03-04 16:24:06,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-03-04 16:24:06,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-03-04 16:24:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2019-03-04 16:24:06,657 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2019-03-04 16:24:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:06,785 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-03-04 16:24:06,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:24:06,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-03-04 16:24:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:06,786 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:24:06,786 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:24:06,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2019-03-04 16:24:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:24:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-03-04 16:24:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:24:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-03-04 16:24:06,792 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-03-04 16:24:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:06,792 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-03-04 16:24:06,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-03-04 16:24:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-03-04 16:24:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-03-04 16:24:06,793 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:06,793 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-03-04 16:24:06,794 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2019-03-04 16:24:06,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:06,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:06,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:06,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:07,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:07,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:07,791 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:07,823 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-03-04 16:24:07,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:07,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 61 conjunts are in the unsatisfiable core [2019-03-04 16:24:07,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:07,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:07,836 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,841 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:08,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2019-03-04 16:24:08,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:24:08,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:24:08,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:08,158 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2019-03-04 16:24:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:08,275 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-03-04 16:24:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:24:08,276 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-03-04 16:24:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:08,277 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:24:08,277 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:24:08,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:24:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-03-04 16:24:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:24:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-03-04 16:24:08,282 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-03-04 16:24:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:08,282 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-03-04 16:24:08,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:24:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-03-04 16:24:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-03-04 16:24:08,283 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:08,283 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-03-04 16:24:08,284 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2019-03-04 16:24:08,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:08,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:08,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:08,695 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:08,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-03-04 16:24:08,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:08,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:24:08,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:08,745 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:08,745 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,749 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2019-03-04 16:24:09,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-03-04 16:24:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-03-04 16:24:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2019-03-04 16:24:09,210 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2019-03-04 16:24:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:09,330 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-03-04 16:24:09,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-03-04 16:24:09,330 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-03-04 16:24:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:09,331 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:24:09,331 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:24:09,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2019-03-04 16:24:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:24:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-03-04 16:24:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:24:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-03-04 16:24:09,337 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-03-04 16:24:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:09,338 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-03-04 16:24:09,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-03-04 16:24:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-03-04 16:24:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-03-04 16:24:09,338 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:09,339 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-03-04 16:24:09,339 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2019-03-04 16:24:09,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:09,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:09,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:09,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:09,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:24:09,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:09,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:09,754 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,787 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,788 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2019-03-04 16:24:10,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-03-04 16:24:10,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-03-04 16:24:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2019-03-04 16:24:10,342 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2019-03-04 16:24:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:10,458 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-03-04 16:24:10,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:24:10,458 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-03-04 16:24:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:10,459 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:24:10,459 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:24:10,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2019-03-04 16:24:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:24:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-03-04 16:24:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:24:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-03-04 16:24:10,545 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-03-04 16:24:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:10,545 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-03-04 16:24:10,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-03-04 16:24:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-03-04 16:24:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-03-04 16:24:10,546 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:10,546 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-03-04 16:24:10,546 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:10,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2019-03-04 16:24:10,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:10,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:10,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:10,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:10,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:10,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:10,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:10,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:24:10,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:10,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:10,973 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,984 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,985 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:11,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2019-03-04 16:24:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:24:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:24:11,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:24:11,337 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2019-03-04 16:24:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:11,518 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-03-04 16:24:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:24:11,519 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-03-04 16:24:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:11,519 INFO L225 Difference]: With dead ends: 69 [2019-03-04 16:24:11,520 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:24:11,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:24:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:24:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-03-04 16:24:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:24:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-03-04 16:24:11,525 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-03-04 16:24:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:11,525 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-03-04 16:24:11,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:24:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-03-04 16:24:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-03-04 16:24:11,526 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:11,526 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-03-04 16:24:11,527 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:11,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:11,527 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2019-03-04 16:24:11,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:11,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:12,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:12,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:12,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:12,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-03-04 16:24:12,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:12,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 73 conjunts are in the unsatisfiable core [2019-03-04 16:24:12,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:12,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:12,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:14,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2019-03-04 16:24:14,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-03-04 16:24:14,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-03-04 16:24:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2019-03-04 16:24:14,134 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2019-03-04 16:24:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:14,268 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-03-04 16:24:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-03-04 16:24:14,270 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-03-04 16:24:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:14,272 INFO L225 Difference]: With dead ends: 72 [2019-03-04 16:24:14,272 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:24:14,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2019-03-04 16:24:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:24:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-03-04 16:24:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-03-04 16:24:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-03-04 16:24:14,276 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-03-04 16:24:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:14,276 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-03-04 16:24:14,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-03-04 16:24:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-03-04 16:24:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-03-04 16:24:14,277 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:14,277 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-03-04 16:24:14,277 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2019-03-04 16:24:14,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:14,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:14,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:14,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:14,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:14,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:14,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:14,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:24:14,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:14,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:14,782 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,790 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:15,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2019-03-04 16:24:15,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-03-04 16:24:15,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-03-04 16:24:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2019-03-04 16:24:15,194 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2019-03-04 16:24:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:15,369 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-03-04 16:24:15,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-03-04 16:24:15,369 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-03-04 16:24:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:15,370 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:24:15,371 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:24:15,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2019-03-04 16:24:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:24:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-03-04 16:24:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:24:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-03-04 16:24:15,376 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-03-04 16:24:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:15,376 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-03-04 16:24:15,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-03-04 16:24:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-03-04 16:24:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:24:15,377 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:15,377 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-03-04 16:24:15,377 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2019-03-04 16:24:15,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:15,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:15,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:15,827 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:15,862 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-03-04 16:24:15,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:15,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 79 conjunts are in the unsatisfiable core [2019-03-04 16:24:15,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:15,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:15,869 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,881 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:16,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:16,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2019-03-04 16:24:16,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:24:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:24:16,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:16,320 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2019-03-04 16:24:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:16,484 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-03-04 16:24:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:24:16,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-03-04 16:24:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:16,485 INFO L225 Difference]: With dead ends: 78 [2019-03-04 16:24:16,485 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:24:16,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:24:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-03-04 16:24:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:24:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-03-04 16:24:16,491 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-03-04 16:24:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:16,491 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-03-04 16:24:16,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:24:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-03-04 16:24:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-03-04 16:24:16,491 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:16,491 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-03-04 16:24:16,492 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2019-03-04 16:24:16,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:16,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:17,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:17,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:17,083 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:17,132 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-03-04 16:24:17,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:17,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 82 conjunts are in the unsatisfiable core [2019-03-04 16:24:17,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:17,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:17,142 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,153 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:17,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:17,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2019-03-04 16:24:17,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-03-04 16:24:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-03-04 16:24:17,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2019-03-04 16:24:17,906 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2019-03-04 16:24:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:18,121 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-03-04 16:24:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:24:18,121 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-03-04 16:24:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:18,123 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:24:18,123 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:24:18,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2019-03-04 16:24:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:24:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-03-04 16:24:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-03-04 16:24:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-03-04 16:24:18,128 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-03-04 16:24:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,129 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-03-04 16:24:18,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-03-04 16:24:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-03-04 16:24:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-03-04 16:24:18,130 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,130 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-03-04 16:24:18,130 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2019-03-04 16:24:18,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:18,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:18,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:18,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 85 conjunts are in the unsatisfiable core [2019-03-04 16:24:18,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:18,707 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:18,708 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,715 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,716 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:19,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:19,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2019-03-04 16:24:19,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-03-04 16:24:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-03-04 16:24:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2019-03-04 16:24:19,314 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2019-03-04 16:24:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:19,487 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-03-04 16:24:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:24:19,488 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-03-04 16:24:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:19,489 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:24:19,489 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:24:19,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2019-03-04 16:24:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:24:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-03-04 16:24:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-03-04 16:24:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-03-04 16:24:19,494 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-03-04 16:24:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:19,495 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-03-04 16:24:19,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-03-04 16:24:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-03-04 16:24:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-03-04 16:24:19,496 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:19,496 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-03-04 16:24:19,496 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:19,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2019-03-04 16:24:19,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:19,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:19,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:19,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:19,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:19,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:20,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:20,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:20,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 88 conjunts are in the unsatisfiable core [2019-03-04 16:24:20,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:20,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:20,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,032 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,033 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:20,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2019-03-04 16:24:20,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-03-04 16:24:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-03-04 16:24:20,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:24:20,561 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2019-03-04 16:24:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:20,742 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-03-04 16:24:20,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-03-04 16:24:20,743 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-03-04 16:24:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:20,744 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:24:20,744 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:24:20,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:24:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:24:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-03-04 16:24:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-03-04 16:24:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-03-04 16:24:20,749 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-03-04 16:24:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:20,749 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-03-04 16:24:20,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-03-04 16:24:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-03-04 16:24:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-03-04 16:24:20,750 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:20,750 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-03-04 16:24:20,750 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2019-03-04 16:24:20,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:20,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:21,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:21,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:21,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-03-04 16:24:21,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:21,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:24:21,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:21,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:21,371 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,383 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,383 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:21,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2019-03-04 16:24:21,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-03-04 16:24:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-03-04 16:24:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:24:21,986 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2019-03-04 16:24:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:22,165 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-03-04 16:24:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:24:22,166 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-03-04 16:24:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:22,167 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:24:22,167 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:24:22,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:24:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:24:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-03-04 16:24:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-03-04 16:24:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-03-04 16:24:22,172 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-03-04 16:24:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:22,173 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-03-04 16:24:22,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-03-04 16:24:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-03-04 16:24:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-03-04 16:24:22,173 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:22,174 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-03-04 16:24:22,174 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2019-03-04 16:24:22,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:22,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:22,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:22,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:22,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:22,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:22,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:22,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 94 conjunts are in the unsatisfiable core [2019-03-04 16:24:22,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:22,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:22,861 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,869 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,870 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:23,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2019-03-04 16:24:23,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-03-04 16:24:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-03-04 16:24:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:24:23,647 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2019-03-04 16:24:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:23,859 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-03-04 16:24:23,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:24:23,860 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-03-04 16:24:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:23,861 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:24:23,861 INFO L226 Difference]: Without dead ends: 92 [2019-03-04 16:24:23,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:24:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-03-04 16:24:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-03-04 16:24:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:24:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-03-04 16:24:23,867 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-03-04 16:24:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:23,868 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-03-04 16:24:23,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-03-04 16:24:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-03-04 16:24:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-03-04 16:24:23,868 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:23,868 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-03-04 16:24:23,869 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:23,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2019-03-04 16:24:23,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:23,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:24,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:24,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:24,356 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:24,410 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-03-04 16:24:24,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:24,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 97 conjunts are in the unsatisfiable core [2019-03-04 16:24:24,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:24,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:24,423 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,431 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,431 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:25,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:25,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2019-03-04 16:24:25,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-03-04 16:24:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-03-04 16:24:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:24:25,093 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2019-03-04 16:24:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:25,290 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-03-04 16:24:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:24:25,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-03-04 16:24:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:25,291 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:24:25,291 INFO L226 Difference]: Without dead ends: 95 [2019-03-04 16:24:25,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:24:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-03-04 16:24:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-03-04 16:24:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:24:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-03-04 16:24:25,297 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-03-04 16:24:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:25,297 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-03-04 16:24:25,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-03-04 16:24:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-03-04 16:24:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-03-04 16:24:25,298 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:25,298 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-03-04 16:24:25,298 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:25,298 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2019-03-04 16:24:25,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:25,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:25,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:25,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:25,912 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:25,980 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-03-04 16:24:25,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:25,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 100 conjunts are in the unsatisfiable core [2019-03-04 16:24:25,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:25,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:25,988 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,000 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,000 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:26,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2019-03-04 16:24:26,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-03-04 16:24:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-03-04 16:24:26,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2019-03-04 16:24:26,658 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2019-03-04 16:24:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:26,875 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-03-04 16:24:26,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-03-04 16:24:26,876 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-03-04 16:24:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:26,877 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:24:26,877 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:24:26,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2019-03-04 16:24:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:24:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-03-04 16:24:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:24:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-03-04 16:24:26,883 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-03-04 16:24:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:26,883 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-03-04 16:24:26,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-03-04 16:24:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-03-04 16:24:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-03-04 16:24:26,884 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:26,884 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-03-04 16:24:26,884 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:26,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2019-03-04 16:24:26,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:26,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:27,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:27,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:27,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:24:27,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:27,706 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:27,706 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,714 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,714 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:28,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:28,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2019-03-04 16:24:28,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-03-04 16:24:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-03-04 16:24:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:24:28,595 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2019-03-04 16:24:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:28,798 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-03-04 16:24:28,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:24:28,799 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-03-04 16:24:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:28,800 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:24:28,800 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:24:28,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:24:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:24:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-03-04 16:24:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:24:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-03-04 16:24:28,805 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-03-04 16:24:28,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:28,805 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-03-04 16:24:28,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-03-04 16:24:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-03-04 16:24:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-03-04 16:24:28,805 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:28,806 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-03-04 16:24:28,806 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:28,806 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2019-03-04 16:24:28,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:28,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:28,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:29,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:29,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:29,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:29,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:29,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:29,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 106 conjunts are in the unsatisfiable core [2019-03-04 16:24:29,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:29,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:29,473 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,537 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,537 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:30,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2019-03-04 16:24:30,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-03-04 16:24:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-03-04 16:24:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:24:30,282 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2019-03-04 16:24:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:30,495 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-03-04 16:24:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:24:30,496 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-03-04 16:24:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:30,497 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:24:30,497 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:24:30,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:24:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:24:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-03-04 16:24:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:24:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-03-04 16:24:30,503 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-03-04 16:24:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:30,504 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-03-04 16:24:30,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-03-04 16:24:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-03-04 16:24:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-03-04 16:24:30,504 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:30,505 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-03-04 16:24:30,505 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2019-03-04 16:24:30,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:30,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:31,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:31,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:31,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-03-04 16:24:31,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:31,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 109 conjunts are in the unsatisfiable core [2019-03-04 16:24:31,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:31,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:31,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,370 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:32,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:32,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2019-03-04 16:24:32,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-03-04 16:24:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-03-04 16:24:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:24:32,161 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2019-03-04 16:24:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:32,418 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-03-04 16:24:32,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:24:32,419 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-03-04 16:24:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:32,420 INFO L225 Difference]: With dead ends: 108 [2019-03-04 16:24:32,420 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:24:32,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:24:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:24:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-03-04 16:24:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-03-04 16:24:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-03-04 16:24:32,425 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-03-04 16:24:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:32,425 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-03-04 16:24:32,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-03-04 16:24:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-03-04 16:24:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-03-04 16:24:32,426 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:32,426 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-03-04 16:24:32,426 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2019-03-04 16:24:32,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:32,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:32,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:32,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:33,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:33,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:33,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:33,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:33,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:33,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 112 conjunts are in the unsatisfiable core [2019-03-04 16:24:33,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:33,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:33,490 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,501 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,502 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:34,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:34,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2019-03-04 16:24:34,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-03-04 16:24:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-03-04 16:24:34,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2019-03-04 16:24:34,297 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2019-03-04 16:24:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:34,514 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-03-04 16:24:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:24:34,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-03-04 16:24:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:34,515 INFO L225 Difference]: With dead ends: 111 [2019-03-04 16:24:34,515 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:24:34,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2019-03-04 16:24:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:24:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-03-04 16:24:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-03-04 16:24:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-03-04 16:24:34,520 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-03-04 16:24:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:34,521 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-03-04 16:24:34,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-03-04 16:24:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-03-04 16:24:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-03-04 16:24:34,521 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:34,522 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-03-04 16:24:34,522 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:34,522 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2019-03-04 16:24:34,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:34,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:35,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:35,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:35,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:35,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-03-04 16:24:35,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:35,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:24:35,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:35,339 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:35,340 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,347 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:36,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:36,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2019-03-04 16:24:36,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:24:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:24:36,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:24:36,277 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2019-03-04 16:24:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:36,738 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-03-04 16:24:36,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-03-04 16:24:36,739 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-03-04 16:24:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:36,740 INFO L225 Difference]: With dead ends: 114 [2019-03-04 16:24:36,740 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:24:36,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:24:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:24:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-03-04 16:24:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:24:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-03-04 16:24:36,745 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-03-04 16:24:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:36,746 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-03-04 16:24:36,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:24:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-03-04 16:24:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-03-04 16:24:36,746 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:36,747 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-03-04 16:24:36,747 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:36,747 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2019-03-04 16:24:36,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:36,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:38,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:38,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:38,678 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-03-04 16:24:38,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:38,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 118 conjunts are in the unsatisfiable core [2019-03-04 16:24:38,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:38,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:38,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,698 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,699 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:39,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:39,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2019-03-04 16:24:39,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-03-04 16:24:39,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-03-04 16:24:39,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2019-03-04 16:24:39,625 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2019-03-04 16:24:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:39,903 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-03-04 16:24:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:24:39,903 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-03-04 16:24:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:39,905 INFO L225 Difference]: With dead ends: 117 [2019-03-04 16:24:39,905 INFO L226 Difference]: Without dead ends: 116 [2019-03-04 16:24:39,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2019-03-04 16:24:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-03-04 16:24:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-03-04 16:24:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-03-04 16:24:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-03-04 16:24:39,910 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-03-04 16:24:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:39,911 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-03-04 16:24:39,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-03-04 16:24:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-03-04 16:24:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-03-04 16:24:39,912 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:39,912 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-03-04 16:24:39,912 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2019-03-04 16:24:39,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:39,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:40,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:40,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:40,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 121 conjunts are in the unsatisfiable core [2019-03-04 16:24:40,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:40,755 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:40,756 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,790 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,791 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:41,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:41,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2019-03-04 16:24:41,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-03-04 16:24:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-03-04 16:24:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:24:41,751 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2019-03-04 16:24:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,056 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-03-04 16:24:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:24:42,057 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-03-04 16:24:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:42,058 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:24:42,058 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:24:42,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:24:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:24:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-03-04 16:24:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-03-04 16:24:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-03-04 16:24:42,064 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-03-04 16:24:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:42,064 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-03-04 16:24:42,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-03-04 16:24:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-03-04 16:24:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-03-04 16:24:42,065 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:42,065 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-03-04 16:24:42,065 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2019-03-04 16:24:42,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:42,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:43,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:43,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:43,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:43,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:43,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:44,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 124 conjunts are in the unsatisfiable core [2019-03-04 16:24:44,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:44,007 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:44,007 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,021 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,022 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:45,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2019-03-04 16:24:45,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:24:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:24:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:24:45,312 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2019-03-04 16:24:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:45,654 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-03-04 16:24:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-03-04 16:24:45,655 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-03-04 16:24:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:45,656 INFO L225 Difference]: With dead ends: 123 [2019-03-04 16:24:45,656 INFO L226 Difference]: Without dead ends: 122 [2019-03-04 16:24:45,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:24:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-03-04 16:24:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-03-04 16:24:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:24:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-03-04 16:24:45,661 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-03-04 16:24:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:45,661 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-03-04 16:24:45,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:24:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-03-04 16:24:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-03-04 16:24:45,662 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:45,662 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-03-04 16:24:45,663 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:45,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2019-03-04 16:24:45,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:46,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:46,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:46,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-03-04 16:24:46,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:46,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 127 conjunts are in the unsatisfiable core [2019-03-04 16:24:46,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:46,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:46,802 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,898 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:49,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:49,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2019-03-04 16:24:49,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-03-04 16:24:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-03-04 16:24:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2019-03-04 16:24:49,198 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2019-03-04 16:24:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:49,435 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-03-04 16:24:49,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-03-04 16:24:49,435 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-03-04 16:24:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:49,436 INFO L225 Difference]: With dead ends: 126 [2019-03-04 16:24:49,437 INFO L226 Difference]: Without dead ends: 125 [2019-03-04 16:24:49,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2019-03-04 16:24:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-03-04 16:24:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-03-04 16:24:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-03-04 16:24:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-03-04 16:24:49,441 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-03-04 16:24:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:49,442 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-03-04 16:24:49,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-03-04 16:24:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-03-04 16:24:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-03-04 16:24:49,443 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:49,443 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-03-04 16:24:49,443 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:49,443 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2019-03-04 16:24:49,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:49,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:49,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:49,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:49,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:50,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:50,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:50,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:50,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:50,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 130 conjunts are in the unsatisfiable core [2019-03-04 16:24:50,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:50,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:50,367 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,379 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2019-03-04 16:24:51,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-03-04 16:24:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-03-04 16:24:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2019-03-04 16:24:51,529 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2019-03-04 16:24:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:51,828 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-03-04 16:24:51,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-03-04 16:24:51,829 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-03-04 16:24:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:51,833 INFO L225 Difference]: With dead ends: 129 [2019-03-04 16:24:51,833 INFO L226 Difference]: Without dead ends: 128 [2019-03-04 16:24:51,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2019-03-04 16:24:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-03-04 16:24:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-03-04 16:24:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-03-04 16:24:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-03-04 16:24:51,838 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-03-04 16:24:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:51,839 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-03-04 16:24:51,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-03-04 16:24:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-03-04 16:24:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-03-04 16:24:51,840 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:51,840 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-03-04 16:24:51,840 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2019-03-04 16:24:51,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:54,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:54,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:54,408 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-03-04 16:24:54,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:54,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 133 conjunts are in the unsatisfiable core [2019-03-04 16:24:54,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:54,417 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:54,417 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,435 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:55,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:55,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2019-03-04 16:24:55,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:24:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:24:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:24:55,550 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2019-03-04 16:24:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:55,843 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-03-04 16:24:55,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:24:55,843 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-03-04 16:24:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:55,845 INFO L225 Difference]: With dead ends: 132 [2019-03-04 16:24:55,845 INFO L226 Difference]: Without dead ends: 131 [2019-03-04 16:24:55,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:24:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-03-04 16:24:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-03-04 16:24:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-03-04 16:24:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-03-04 16:24:55,850 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-03-04 16:24:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:55,851 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-03-04 16:24:55,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:24:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-03-04 16:24:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-03-04 16:24:55,851 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:55,852 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-03-04 16:24:55,852 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2019-03-04 16:24:55,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:55,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:57,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:57,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:57,206 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:57,310 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-03-04 16:24:57,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:57,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 136 conjunts are in the unsatisfiable core [2019-03-04 16:24:57,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:57,342 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:57,343 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,371 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:58,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:58,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2019-03-04 16:24:58,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-03-04 16:24:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-03-04 16:24:58,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2019-03-04 16:24:58,509 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2019-03-04 16:24:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:59,459 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-03-04 16:24:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-03-04 16:24:59,460 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-03-04 16:24:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:59,461 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:24:59,461 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:24:59,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2019-03-04 16:24:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:24:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-03-04 16:24:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:24:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-03-04 16:24:59,466 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-03-04 16:24:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:59,467 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-03-04 16:24:59,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-03-04 16:24:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-03-04 16:24:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:24:59,468 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:59,468 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-03-04 16:24:59,468 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:59,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:59,468 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2019-03-04 16:24:59,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:59,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:01,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:01,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:01,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:01,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 16:25:01,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:01,180 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:01,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,193 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,194 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:02,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:02,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2019-03-04 16:25:02,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-03-04 16:25:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-03-04 16:25:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2019-03-04 16:25:02,543 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2019-03-04 16:25:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:02,815 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-03-04 16:25:02,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-03-04 16:25:02,815 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-03-04 16:25:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:02,817 INFO L225 Difference]: With dead ends: 138 [2019-03-04 16:25:02,817 INFO L226 Difference]: Without dead ends: 137 [2019-03-04 16:25:02,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2019-03-04 16:25:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-03-04 16:25:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-03-04 16:25:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:25:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-03-04 16:25:02,821 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-03-04 16:25:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:02,822 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-03-04 16:25:02,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-03-04 16:25:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-03-04 16:25:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:25:02,822 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:02,822 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-03-04 16:25:02,822 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:02,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:02,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2019-03-04 16:25:02,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:02,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:04,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:04,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:04,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:04,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:04,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:04,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 142 conjunts are in the unsatisfiable core [2019-03-04 16:25:04,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:04,376 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:04,376 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,387 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,387 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:05,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:05,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2019-03-04 16:25:05,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:25:05,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:25:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:25:05,690 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2019-03-04 16:25:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:05,953 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-03-04 16:25:05,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:25:05,957 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-03-04 16:25:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:05,958 INFO L225 Difference]: With dead ends: 141 [2019-03-04 16:25:05,958 INFO L226 Difference]: Without dead ends: 140 [2019-03-04 16:25:05,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:25:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-03-04 16:25:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-03-04 16:25:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-03-04 16:25:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-03-04 16:25:05,964 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-03-04 16:25:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:05,965 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-03-04 16:25:05,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:25:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-03-04 16:25:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-03-04 16:25:05,965 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:05,966 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-03-04 16:25:05,966 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2019-03-04 16:25:05,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:05,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:05,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:07,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:07,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:07,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:07,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-03-04 16:25:07,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:07,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 145 conjunts are in the unsatisfiable core [2019-03-04 16:25:07,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:07,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:07,280 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,289 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,289 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:08,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:08,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2019-03-04 16:25:08,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-03-04 16:25:08,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-03-04 16:25:08,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:25:08,729 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2019-03-04 16:25:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:09,236 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-03-04 16:25:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:25:09,237 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2019-03-04 16:25:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:09,238 INFO L225 Difference]: With dead ends: 144 [2019-03-04 16:25:09,238 INFO L226 Difference]: Without dead ends: 143 [2019-03-04 16:25:09,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:25:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-03-04 16:25:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-03-04 16:25:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-03-04 16:25:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-03-04 16:25:09,244 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-03-04 16:25:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:09,244 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-03-04 16:25:09,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-03-04 16:25:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-03-04 16:25:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-03-04 16:25:09,245 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:09,245 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2019-03-04 16:25:09,246 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2019-03-04 16:25:09,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:10,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:10,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:10,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:10,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:10,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:10,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 148 conjunts are in the unsatisfiable core [2019-03-04 16:25:10,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:10,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:10,424 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,435 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:11,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:11,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2019-03-04 16:25:11,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-03-04 16:25:11,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-03-04 16:25:11,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2019-03-04 16:25:11,806 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2019-03-04 16:25:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:12,154 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-03-04 16:25:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-03-04 16:25:12,155 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2019-03-04 16:25:12,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:12,156 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:25:12,156 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:25:12,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2019-03-04 16:25:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:25:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-03-04 16:25:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-03-04 16:25:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-03-04 16:25:12,161 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-03-04 16:25:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:12,161 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-03-04 16:25:12,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-03-04 16:25:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-03-04 16:25:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-03-04 16:25:12,162 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:12,162 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2019-03-04 16:25:12,162 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:12,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:12,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2019-03-04 16:25:12,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:12,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:12,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:12,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:13,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:13,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:25:13,603 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-03-04 16:25:13,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:13,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 151 conjunts are in the unsatisfiable core [2019-03-04 16:25:13,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:13,634 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:13,635 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,720 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,721 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:15,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:15,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2019-03-04 16:25:15,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-03-04 16:25:15,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-03-04 16:25:15,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:25:15,479 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2019-03-04 16:25:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:15,828 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-03-04 16:25:15,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:25:15,828 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2019-03-04 16:25:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:15,830 INFO L225 Difference]: With dead ends: 150 [2019-03-04 16:25:15,830 INFO L226 Difference]: Without dead ends: 149 [2019-03-04 16:25:15,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:25:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-03-04 16:25:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-03-04 16:25:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-03-04 16:25:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-03-04 16:25:15,836 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-03-04 16:25:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:15,837 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-03-04 16:25:15,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-03-04 16:25:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-03-04 16:25:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-03-04 16:25:15,838 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:15,838 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2019-03-04 16:25:15,838 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2019-03-04 16:25:15,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:15,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:15,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:17,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:17,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:17,261 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-03-04 16:25:17,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:17,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 154 conjunts are in the unsatisfiable core [2019-03-04 16:25:17,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:17,270 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:17,270 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,280 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2019-03-04 16:25:18,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-03-04 16:25:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-03-04 16:25:18,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2019-03-04 16:25:18,721 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2019-03-04 16:25:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:19,221 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-03-04 16:25:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:25:19,221 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2019-03-04 16:25:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:19,222 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:25:19,222 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:25:19,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2019-03-04 16:25:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:25:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-03-04 16:25:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-03-04 16:25:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-03-04 16:25:19,228 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-03-04 16:25:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:19,229 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-03-04 16:25:19,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-03-04 16:25:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-03-04 16:25:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-03-04 16:25:19,229 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:19,230 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2019-03-04 16:25:19,230 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:19,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:19,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2019-03-04 16:25:19,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:19,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:19,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:19,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:20,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:20,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:20,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 157 conjunts are in the unsatisfiable core [2019-03-04 16:25:20,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:20,655 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:20,656 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,666 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,666 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:22,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:22,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2019-03-04 16:25:22,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-03-04 16:25:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-03-04 16:25:22,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:25:22,135 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2019-03-04 16:25:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:22,425 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-03-04 16:25:22,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:25:22,426 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2019-03-04 16:25:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:22,428 INFO L225 Difference]: With dead ends: 156 [2019-03-04 16:25:22,428 INFO L226 Difference]: Without dead ends: 155 [2019-03-04 16:25:22,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:25:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-03-04 16:25:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-03-04 16:25:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-03-04 16:25:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-03-04 16:25:22,434 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-03-04 16:25:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:22,435 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-03-04 16:25:22,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-03-04 16:25:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-03-04 16:25:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-03-04 16:25:22,436 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:22,436 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2019-03-04 16:25:22,436 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2019-03-04 16:25:22,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:22,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:23,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:23,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:23,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:23,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:23,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:23,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 160 conjunts are in the unsatisfiable core [2019-03-04 16:25:23,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:23,771 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:23,771 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,779 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,779 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:25,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:25,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2019-03-04 16:25:25,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:25:25,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:25:25,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:25:25,837 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2019-03-04 16:25:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:26,188 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-03-04 16:25:26,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-03-04 16:25:26,188 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2019-03-04 16:25:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:26,190 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:25:26,190 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:25:26,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:25:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:25:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-03-04 16:25:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:25:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-03-04 16:25:26,194 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-03-04 16:25:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:26,195 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-03-04 16:25:26,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:25:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-03-04 16:25:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:25:26,196 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:26,196 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2019-03-04 16:25:26,196 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2019-03-04 16:25:26,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:26,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:27,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:27,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:27,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:27,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-03-04 16:25:27,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:27,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:25:27,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:27,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:27,759 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,767 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,768 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:29,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:29,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2019-03-04 16:25:29,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-03-04 16:25:29,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-03-04 16:25:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:25:29,649 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2019-03-04 16:25:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:30,014 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-03-04 16:25:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:25:30,015 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2019-03-04 16:25:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:30,016 INFO L225 Difference]: With dead ends: 162 [2019-03-04 16:25:30,016 INFO L226 Difference]: Without dead ends: 161 [2019-03-04 16:25:30,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:25:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-03-04 16:25:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-03-04 16:25:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-03-04 16:25:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-03-04 16:25:30,021 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-03-04 16:25:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:30,021 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-03-04 16:25:30,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-03-04 16:25:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-03-04 16:25:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-03-04 16:25:30,022 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:30,022 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2019-03-04 16:25:30,022 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:30,023 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2019-03-04 16:25:30,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:30,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:30,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:31,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:31,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:31,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:31,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:31,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:31,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 166 conjunts are in the unsatisfiable core [2019-03-04 16:25:31,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:31,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:31,491 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,500 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:33,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:33,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2019-03-04 16:25:33,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-03-04 16:25:33,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-03-04 16:25:33,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2019-03-04 16:25:33,153 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2019-03-04 16:25:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:33,534 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-03-04 16:25:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:25:33,535 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2019-03-04 16:25:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:33,536 INFO L225 Difference]: With dead ends: 165 [2019-03-04 16:25:33,536 INFO L226 Difference]: Without dead ends: 164 [2019-03-04 16:25:33,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2019-03-04 16:25:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-03-04 16:25:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-03-04 16:25:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-03-04 16:25:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-03-04 16:25:33,542 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-03-04 16:25:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:33,542 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-03-04 16:25:33,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-03-04 16:25:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-03-04 16:25:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-03-04 16:25:33,542 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:33,543 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2019-03-04 16:25:33,543 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2019-03-04 16:25:33,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:33,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:33,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:35,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:35,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:25:35,292 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-03-04 16:25:35,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:35,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 169 conjunts are in the unsatisfiable core [2019-03-04 16:25:35,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:35,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:35,303 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,314 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:37,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:37,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2019-03-04 16:25:37,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-03-04 16:25:37,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-03-04 16:25:37,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:25:37,943 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2019-03-04 16:25:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:38,319 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-03-04 16:25:38,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:25:38,320 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2019-03-04 16:25:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:38,321 INFO L225 Difference]: With dead ends: 168 [2019-03-04 16:25:38,321 INFO L226 Difference]: Without dead ends: 167 [2019-03-04 16:25:38,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:25:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-03-04 16:25:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-03-04 16:25:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-03-04 16:25:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-03-04 16:25:38,328 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-03-04 16:25:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:38,328 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-03-04 16:25:38,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-03-04 16:25:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-03-04 16:25:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-03-04 16:25:38,329 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:38,329 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2019-03-04 16:25:38,329 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2019-03-04 16:25:38,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:38,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:40,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:40,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:40,223 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-03-04 16:25:40,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:40,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 172 conjunts are in the unsatisfiable core [2019-03-04 16:25:40,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:40,256 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:40,257 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,344 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,345 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:42,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:42,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2019-03-04 16:25:42,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-03-04 16:25:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-03-04 16:25:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2019-03-04 16:25:42,120 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2019-03-04 16:25:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:42,513 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-03-04 16:25:42,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-03-04 16:25:42,513 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2019-03-04 16:25:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:42,514 INFO L225 Difference]: With dead ends: 171 [2019-03-04 16:25:42,515 INFO L226 Difference]: Without dead ends: 170 [2019-03-04 16:25:42,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2019-03-04 16:25:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-03-04 16:25:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-03-04 16:25:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-03-04 16:25:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-03-04 16:25:42,520 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-03-04 16:25:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:42,520 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-03-04 16:25:42,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-03-04 16:25:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-03-04 16:25:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-03-04 16:25:42,521 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:42,521 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2019-03-04 16:25:42,521 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:42,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:42,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2019-03-04 16:25:42,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:42,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:42,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:43,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:43,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:43,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:44,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 175 conjunts are in the unsatisfiable core [2019-03-04 16:25:44,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:44,057 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:44,057 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,067 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:46,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:46,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2019-03-04 16:25:46,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-03-04 16:25:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-03-04 16:25:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:25:46,211 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2019-03-04 16:25:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:46,626 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-03-04 16:25:46,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:25:46,626 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2019-03-04 16:25:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:46,628 INFO L225 Difference]: With dead ends: 174 [2019-03-04 16:25:46,628 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:25:46,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:25:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:25:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-03-04 16:25:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-03-04 16:25:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-03-04 16:25:46,633 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-03-04 16:25:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:46,633 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-03-04 16:25:46,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-03-04 16:25:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-03-04 16:25:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-03-04 16:25:46,634 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:46,634 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2019-03-04 16:25:46,634 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:46,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:46,634 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2019-03-04 16:25:46,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:46,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:46,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:46,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:46,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:48,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:48,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:48,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:48,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:48,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:48,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 178 conjunts are in the unsatisfiable core [2019-03-04 16:25:48,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:48,382 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:48,382 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,393 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,393 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:51,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:51,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2019-03-04 16:25:51,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-03-04 16:25:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-03-04 16:25:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:25:51,076 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2019-03-04 16:25:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:51,431 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-03-04 16:25:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:25:51,431 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2019-03-04 16:25:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:51,433 INFO L225 Difference]: With dead ends: 177 [2019-03-04 16:25:51,433 INFO L226 Difference]: Without dead ends: 176 [2019-03-04 16:25:51,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:25:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-03-04 16:25:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-03-04 16:25:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-03-04 16:25:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-03-04 16:25:51,437 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-03-04 16:25:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:51,438 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-03-04 16:25:51,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-03-04 16:25:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-03-04 16:25:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-03-04 16:25:51,438 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:51,438 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2019-03-04 16:25:51,439 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2019-03-04 16:25:51,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:51,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:53,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:53,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:53,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:53,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-03-04 16:25:53,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:53,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 181 conjunts are in the unsatisfiable core [2019-03-04 16:25:53,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:53,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:53,304 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:55,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:55,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2019-03-04 16:25:55,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-03-04 16:25:55,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-03-04 16:25:55,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:25:55,519 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2019-03-04 16:25:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:55,907 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-03-04 16:25:55,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:25:55,907 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2019-03-04 16:25:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:55,908 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:25:55,909 INFO L226 Difference]: Without dead ends: 179 [2019-03-04 16:25:55,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:25:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-03-04 16:25:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-03-04 16:25:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:25:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-03-04 16:25:55,915 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-03-04 16:25:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:55,915 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-03-04 16:25:55,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-03-04 16:25:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-03-04 16:25:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-03-04 16:25:55,916 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:55,916 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2019-03-04 16:25:55,916 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2019-03-04 16:25:55,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:55,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:55,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:57,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:57,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:57,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:57,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:57,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 184 conjunts are in the unsatisfiable core [2019-03-04 16:25:57,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:57,624 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:57,624 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,632 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,633 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:59,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:59,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2019-03-04 16:25:59,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-03-04 16:25:59,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-03-04 16:25:59,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:25:59,649 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2019-03-04 16:26:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:00,097 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-03-04 16:26:00,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-03-04 16:26:00,098 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2019-03-04 16:26:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:00,099 INFO L225 Difference]: With dead ends: 183 [2019-03-04 16:26:00,099 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:26:00,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:26:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:26:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-03-04 16:26:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-03-04 16:26:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-03-04 16:26:00,104 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-03-04 16:26:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:00,105 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-03-04 16:26:00,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-03-04 16:26:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-03-04 16:26:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-03-04 16:26:00,106 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:00,106 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2019-03-04 16:26:00,106 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2019-03-04 16:26:00,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:00,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:00,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:00,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:00,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:01,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:01,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:26:02,271 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-03-04 16:26:02,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:02,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 187 conjunts are in the unsatisfiable core [2019-03-04 16:26:02,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:02,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:02,286 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,294 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,294 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2019-03-04 16:26:04,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-03-04 16:26:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-03-04 16:26:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:26:04,375 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2019-03-04 16:26:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:04,750 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-03-04 16:26:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:26:04,750 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2019-03-04 16:26:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:04,752 INFO L225 Difference]: With dead ends: 186 [2019-03-04 16:26:04,752 INFO L226 Difference]: Without dead ends: 185 [2019-03-04 16:26:04,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:26:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-03-04 16:26:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-03-04 16:26:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-03-04 16:26:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-03-04 16:26:04,759 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-03-04 16:26:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:04,759 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-03-04 16:26:04,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-03-04 16:26:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-03-04 16:26:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-03-04 16:26:04,760 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:04,760 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2019-03-04 16:26:04,760 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2019-03-04 16:26:04,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:04,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:04,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:04,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:06,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:06,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:06,926 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:26:07,113 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-03-04 16:26:07,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:07,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 190 conjunts are in the unsatisfiable core [2019-03-04 16:26:07,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:07,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:07,145 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,157 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,157 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:09,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:09,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2019-03-04 16:26:09,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-03-04 16:26:09,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-03-04 16:26:09,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2019-03-04 16:26:09,372 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2019-03-04 16:26:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:09,779 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-03-04 16:26:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:26:09,780 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2019-03-04 16:26:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:09,781 INFO L225 Difference]: With dead ends: 189 [2019-03-04 16:26:09,781 INFO L226 Difference]: Without dead ends: 188 [2019-03-04 16:26:09,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2019-03-04 16:26:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-03-04 16:26:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-03-04 16:26:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-03-04 16:26:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-03-04 16:26:09,785 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-03-04 16:26:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:09,786 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-03-04 16:26:09,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-03-04 16:26:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-03-04 16:26:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-03-04 16:26:09,786 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:09,787 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2019-03-04 16:26:09,787 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2019-03-04 16:26:09,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:09,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:09,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:09,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:09,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:11,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:11,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:11,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 193 conjunts are in the unsatisfiable core [2019-03-04 16:26:11,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:11,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:11,867 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,875 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,876 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:14,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:14,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2019-03-04 16:26:14,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-03-04 16:26:14,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-03-04 16:26:14,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:26:14,128 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2019-03-04 16:26:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:14,505 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-03-04 16:26:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:26:14,505 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2019-03-04 16:26:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:14,507 INFO L225 Difference]: With dead ends: 192 [2019-03-04 16:26:14,507 INFO L226 Difference]: Without dead ends: 191 [2019-03-04 16:26:14,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:26:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-03-04 16:26:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-03-04 16:26:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-03-04 16:26:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-03-04 16:26:14,512 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-03-04 16:26:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:14,512 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-03-04 16:26:14,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-03-04 16:26:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-03-04 16:26:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-03-04 16:26:14,513 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:14,513 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2019-03-04 16:26:14,513 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2019-03-04 16:26:14,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:14,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:14,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:16,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:16,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:16,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:16,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:16,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:16,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 196 conjunts are in the unsatisfiable core [2019-03-04 16:26:16,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:16,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:16,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,816 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,816 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:19,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:19,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2019-03-04 16:26:19,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:26:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:26:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:26:19,116 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2019-03-04 16:26:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:19,596 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-03-04 16:26:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:26:19,597 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2019-03-04 16:26:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:19,598 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:26:19,598 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:26:19,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:26:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:26:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-03-04 16:26:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-03-04 16:26:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-03-04 16:26:19,604 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-03-04 16:26:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:19,605 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-03-04 16:26:19,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:26:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-03-04 16:26:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-03-04 16:26:19,605 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:19,606 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2019-03-04 16:26:19,606 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2019-03-04 16:26:19,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:19,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:19,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:21,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:21,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:21,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:22,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-03-04 16:26:22,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:22,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 199 conjunts are in the unsatisfiable core [2019-03-04 16:26:22,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:22,100 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:22,100 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,109 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:24,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2019-03-04 16:26:24,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-03-04 16:26:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-03-04 16:26:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2019-03-04 16:26:24,444 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2019-03-04 16:26:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:24,857 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-03-04 16:26:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-03-04 16:26:24,858 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2019-03-04 16:26:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:24,859 INFO L225 Difference]: With dead ends: 198 [2019-03-04 16:26:24,860 INFO L226 Difference]: Without dead ends: 197 [2019-03-04 16:26:24,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2019-03-04 16:26:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-03-04 16:26:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-03-04 16:26:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-03-04 16:26:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-03-04 16:26:24,866 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-03-04 16:26:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:24,867 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-03-04 16:26:24,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-03-04 16:26:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-03-04 16:26:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-03-04 16:26:24,868 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:24,868 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2019-03-04 16:26:24,868 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:24,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2019-03-04 16:26:24,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:24,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:27,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:27,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:27,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:26:27,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:26:27,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:27,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 202 conjunts are in the unsatisfiable core [2019-03-04 16:26:27,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:27,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:27,157 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,167 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,167 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:29,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2019-03-04 16:26:29,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-03-04 16:26:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-03-04 16:26:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2019-03-04 16:26:29,822 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-03-04 16:26:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:30,217 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-03-04 16:26:30,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:26:30,218 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-03-04 16:26:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:30,219 INFO L225 Difference]: With dead ends: 201 [2019-03-04 16:26:30,219 INFO L226 Difference]: Without dead ends: 200 [2019-03-04 16:26:30,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2019-03-04 16:26:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-03-04 16:26:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-03-04 16:26:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-03-04 16:26:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-03-04 16:26:30,226 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-03-04 16:26:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:30,226 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-03-04 16:26:30,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-03-04 16:26:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-03-04 16:26:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-03-04 16:26:30,227 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:30,227 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2019-03-04 16:26:30,228 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2019-03-04 16:26:30,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:30,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:32,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:32,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:32,539 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:26:32,704 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-03-04 16:26:32,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:32,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 205 conjunts are in the unsatisfiable core [2019-03-04 16:26:32,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:32,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:32,716 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,729 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:35,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:35,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2019-03-04 16:26:35,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-03-04 16:26:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-03-04 16:26:35,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:26:35,158 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2019-03-04 16:26:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:35,553 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-03-04 16:26:35,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:26:35,553 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2019-03-04 16:26:35,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:35,555 INFO L225 Difference]: With dead ends: 204 [2019-03-04 16:26:35,555 INFO L226 Difference]: Without dead ends: 203 [2019-03-04 16:26:35,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:26:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-03-04 16:26:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-03-04 16:26:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-03-04 16:26:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-03-04 16:26:35,561 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-03-04 16:26:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:35,562 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-03-04 16:26:35,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-03-04 16:26:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-03-04 16:26:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-03-04 16:26:35,563 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:35,563 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2019-03-04 16:26:35,563 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:35,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:35,563 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2019-03-04 16:26:35,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:35,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:35,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:35,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:35,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:37,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:37,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:37,952 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:26:38,182 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-03-04 16:26:38,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:38,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 208 conjunts are in the unsatisfiable core [2019-03-04 16:26:38,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:38,211 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:38,212 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,221 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,222 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:40,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:40,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2019-03-04 16:26:40,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-03-04 16:26:40,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-03-04 16:26:40,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2019-03-04 16:26:40,786 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2019-03-04 16:26:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:41,295 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-03-04 16:26:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-03-04 16:26:41,295 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2019-03-04 16:26:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:41,297 INFO L225 Difference]: With dead ends: 207 [2019-03-04 16:26:41,297 INFO L226 Difference]: Without dead ends: 206 [2019-03-04 16:26:41,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2019-03-04 16:26:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-03-04 16:26:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-03-04 16:26:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-03-04 16:26:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-03-04 16:26:41,302 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-03-04 16:26:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:41,302 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-03-04 16:26:41,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-03-04 16:26:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-03-04 16:26:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-03-04 16:26:41,303 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:41,303 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2019-03-04 16:26:41,303 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2019-03-04 16:26:41,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:41,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:41,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:41,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:41,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:43,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:43,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:43,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:43,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 211 conjunts are in the unsatisfiable core [2019-03-04 16:26:43,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:43,470 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:43,470 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:43,481 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:43,481 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:46,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:46,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2019-03-04 16:26:46,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-03-04 16:26:46,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-03-04 16:26:46,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2019-03-04 16:26:46,129 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2019-03-04 16:26:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:46,597 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-03-04 16:26:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 16:26:46,597 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2019-03-04 16:26:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:46,599 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:26:46,599 INFO L226 Difference]: Without dead ends: 209 [2019-03-04 16:26:46,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2019-03-04 16:26:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-03-04 16:26:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-03-04 16:26:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-03-04 16:26:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-03-04 16:26:46,604 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-03-04 16:26:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:46,605 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-03-04 16:26:46,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-03-04 16:26:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-03-04 16:26:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-03-04 16:26:46,605 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:46,606 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2019-03-04 16:26:46,606 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2019-03-04 16:26:46,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:46,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:46,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:48,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:48,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:48,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:48,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:48,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:48,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 214 conjunts are in the unsatisfiable core [2019-03-04 16:26:48,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:48,845 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:48,846 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,856 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,856 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:51,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:51,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2019-03-04 16:26:51,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-03-04 16:26:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-03-04 16:26:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:26:51,776 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2019-03-04 16:26:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:52,206 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-03-04 16:26:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-03-04 16:26:52,206 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2019-03-04 16:26:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:52,208 INFO L225 Difference]: With dead ends: 213 [2019-03-04 16:26:52,208 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:26:52,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:26:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:26:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-03-04 16:26:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-03-04 16:26:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-03-04 16:26:52,215 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-03-04 16:26:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:52,215 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-03-04 16:26:52,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-03-04 16:26:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-03-04 16:26:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-03-04 16:26:52,216 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:52,217 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2019-03-04 16:26:52,217 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2019-03-04 16:26:52,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:52,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:52,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:52,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:52,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:54,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:54,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:54,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:54,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-03-04 16:26:54,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:54,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 217 conjunts are in the unsatisfiable core [2019-03-04 16:26:54,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:54,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:26:54,837 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,848 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:57,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:57,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2019-03-04 16:26:57,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-03-04 16:26:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-03-04 16:26:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 16:26:57,779 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2019-03-04 16:26:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:58,246 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-03-04 16:26:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:26:58,246 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2019-03-04 16:26:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:58,248 INFO L225 Difference]: With dead ends: 216 [2019-03-04 16:26:58,248 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:26:58,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 16:26:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:26:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-03-04 16:26:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:26:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-03-04 16:26:58,255 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-03-04 16:26:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:58,255 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-03-04 16:26:58,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-03-04 16:26:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-03-04 16:26:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-03-04 16:26:58,256 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:58,257 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2019-03-04 16:26:58,257 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2019-03-04 16:26:58,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:58,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:58,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:00,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:00,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:27:00,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:27:00,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:00,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 220 conjunts are in the unsatisfiable core [2019-03-04 16:27:00,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:00,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:00,598 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,609 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:03,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2019-03-04 16:27:03,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-03-04 16:27:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-03-04 16:27:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2019-03-04 16:27:03,467 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2019-03-04 16:27:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:03,978 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-03-04 16:27:03,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-03-04 16:27:03,979 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2019-03-04 16:27:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:03,980 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:27:03,980 INFO L226 Difference]: Without dead ends: 218 [2019-03-04 16:27:03,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2019-03-04 16:27:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-03-04 16:27:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-03-04 16:27:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:27:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-03-04 16:27:03,986 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-03-04 16:27:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:03,987 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-03-04 16:27:03,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-03-04 16:27:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-03-04 16:27:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:27:03,988 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:03,988 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2019-03-04 16:27:03,988 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:03,988 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2019-03-04 16:27:03,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:03,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:03,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:06,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:06,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:06,391 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:27:06,586 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-03-04 16:27:06,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:06,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 223 conjunts are in the unsatisfiable core [2019-03-04 16:27:06,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:06,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:06,598 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,609 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2019-03-04 16:27:09,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-03-04 16:27:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-03-04 16:27:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:27:09,677 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2019-03-04 16:27:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:10,149 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-03-04 16:27:10,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-03-04 16:27:10,149 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2019-03-04 16:27:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:10,151 INFO L225 Difference]: With dead ends: 222 [2019-03-04 16:27:10,151 INFO L226 Difference]: Without dead ends: 221 [2019-03-04 16:27:10,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:27:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-03-04 16:27:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-03-04 16:27:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:27:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-03-04 16:27:10,156 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-03-04 16:27:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:10,156 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-03-04 16:27:10,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-03-04 16:27:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-03-04 16:27:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-03-04 16:27:10,157 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:10,158 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2019-03-04 16:27:10,158 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2019-03-04 16:27:10,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:10,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:10,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:12,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:12,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:27:12,836 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-03-04 16:27:12,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:12,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 226 conjunts are in the unsatisfiable core [2019-03-04 16:27:12,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:12,850 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:12,850 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,858 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,858 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:15,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:15,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2019-03-04 16:27:15,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-03-04 16:27:15,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-03-04 16:27:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2019-03-04 16:27:15,804 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2019-03-04 16:27:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:16,290 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-03-04 16:27:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:27:16,291 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2019-03-04 16:27:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:16,292 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:27:16,292 INFO L226 Difference]: Without dead ends: 224 [2019-03-04 16:27:16,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2019-03-04 16:27:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-03-04 16:27:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-03-04 16:27:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-03-04 16:27:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-03-04 16:27:16,298 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-03-04 16:27:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:16,298 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-03-04 16:27:16,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-03-04 16:27:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-03-04 16:27:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-03-04 16:27:16,299 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:16,299 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2019-03-04 16:27:16,299 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2019-03-04 16:27:16,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:16,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:19,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:19,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:19,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 229 conjunts are in the unsatisfiable core [2019-03-04 16:27:19,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:19,122 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:19,122 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,130 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,131 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:22,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:22,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2019-03-04 16:27:22,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-03-04 16:27:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-03-04 16:27:22,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:27:22,260 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2019-03-04 16:27:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:22,857 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-03-04 16:27:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:27:22,857 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2019-03-04 16:27:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:22,859 INFO L225 Difference]: With dead ends: 228 [2019-03-04 16:27:22,859 INFO L226 Difference]: Without dead ends: 227 [2019-03-04 16:27:22,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:27:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-03-04 16:27:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-03-04 16:27:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-03-04 16:27:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-03-04 16:27:22,866 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-03-04 16:27:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:22,866 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-03-04 16:27:22,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-03-04 16:27:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-03-04 16:27:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-03-04 16:27:22,867 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:22,868 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2019-03-04 16:27:22,868 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2019-03-04 16:27:22,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:22,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:22,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:22,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:22,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:25,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:25,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:25,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:25,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:25,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 232 conjunts are in the unsatisfiable core [2019-03-04 16:27:25,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:25,536 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:25,536 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,544 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,544 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:28,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:28,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2019-03-04 16:27:28,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-03-04 16:27:28,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-03-04 16:27:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:27:28,794 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2019-03-04 16:27:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:29,341 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-03-04 16:27:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-03-04 16:27:29,341 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2019-03-04 16:27:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:29,343 INFO L225 Difference]: With dead ends: 231 [2019-03-04 16:27:29,343 INFO L226 Difference]: Without dead ends: 230 [2019-03-04 16:27:29,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:27:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-03-04 16:27:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-03-04 16:27:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-03-04 16:27:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-03-04 16:27:29,349 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-03-04 16:27:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:29,349 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-03-04 16:27:29,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-03-04 16:27:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-03-04 16:27:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-03-04 16:27:29,350 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:29,350 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2019-03-04 16:27:29,350 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2019-03-04 16:27:29,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:29,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:29,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:29,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:32,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:32,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:32,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:32,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-03-04 16:27:32,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:32,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 235 conjunts are in the unsatisfiable core [2019-03-04 16:27:32,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:32,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:32,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:32,411 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:32,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:35,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:35,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2019-03-04 16:27:35,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-03-04 16:27:35,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-03-04 16:27:35,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:27:35,734 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2019-03-04 16:27:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:36,259 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-03-04 16:27:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-03-04 16:27:36,260 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2019-03-04 16:27:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:36,261 INFO L225 Difference]: With dead ends: 234 [2019-03-04 16:27:36,261 INFO L226 Difference]: Without dead ends: 233 [2019-03-04 16:27:36,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:27:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-03-04 16:27:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-03-04 16:27:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-03-04 16:27:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-03-04 16:27:36,267 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-03-04 16:27:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-03-04 16:27:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-03-04 16:27:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-03-04 16:27:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-03-04 16:27:36,269 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:36,269 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2019-03-04 16:27:36,269 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2019-03-04 16:27:36,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:36,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:38,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:38,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:27:38,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:27:38,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:38,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 238 conjunts are in the unsatisfiable core [2019-03-04 16:27:38,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:38,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:38,958 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:38,966 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:38,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:42,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:42,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 154 [2019-03-04 16:27:42,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-03-04 16:27:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-03-04 16:27:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:27:42,170 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2019-03-04 16:27:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:42,799 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-03-04 16:27:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-03-04 16:27:42,799 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2019-03-04 16:27:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:42,801 INFO L225 Difference]: With dead ends: 237 [2019-03-04 16:27:42,801 INFO L226 Difference]: Without dead ends: 236 [2019-03-04 16:27:42,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11704 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:27:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-03-04 16:27:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-03-04 16:27:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-03-04 16:27:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-03-04 16:27:42,806 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-03-04 16:27:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:42,807 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-03-04 16:27:42,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-03-04 16:27:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-03-04 16:27:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-03-04 16:27:42,808 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:42,808 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2019-03-04 16:27:42,808 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2019-03-04 16:27:42,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:42,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:42,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:45,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:45,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:45,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:27:45,654 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-03-04 16:27:45,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:45,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 241 conjunts are in the unsatisfiable core [2019-03-04 16:27:45,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:45,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:45,667 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,677 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,677 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:49,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:49,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 156 [2019-03-04 16:27:49,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-03-04 16:27:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-03-04 16:27:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:27:49,020 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2019-03-04 16:27:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:49,540 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-03-04 16:27:49,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 16:27:49,540 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2019-03-04 16:27:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:49,542 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:27:49,542 INFO L226 Difference]: Without dead ends: 239 [2019-03-04 16:27:49,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12012 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:27:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-03-04 16:27:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-03-04 16:27:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-03-04 16:27:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-03-04 16:27:49,547 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-03-04 16:27:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:49,548 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-03-04 16:27:49,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-03-04 16:27:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-03-04 16:27:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-03-04 16:27:49,549 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:49,549 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2019-03-04 16:27:49,549 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2019-03-04 16:27:49,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:49,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:49,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:49,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:49,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:52,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:52,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:52,306 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:27:52,616 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-03-04 16:27:52,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:52,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 244 conjunts are in the unsatisfiable core [2019-03-04 16:27:52,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:52,627 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:52,627 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:52,637 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:52,637 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:56,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 158 [2019-03-04 16:27:56,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-03-04 16:27:56,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-03-04 16:27:56,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:27:56,007 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2019-03-04 16:27:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:56,566 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-03-04 16:27:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-03-04 16:27:56,567 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2019-03-04 16:27:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:56,568 INFO L225 Difference]: With dead ends: 243 [2019-03-04 16:27:56,568 INFO L226 Difference]: Without dead ends: 242 [2019-03-04 16:27:56,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12324 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:27:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-03-04 16:27:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-03-04 16:27:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:27:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-03-04 16:27:56,574 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-03-04 16:27:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:56,574 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-03-04 16:27:56,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-03-04 16:27:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-03-04 16:27:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:27:56,575 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:56,575 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2019-03-04 16:27:56,575 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2019-03-04 16:27:56,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:56,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:56,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:56,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:00,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:00,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:00,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 247 conjunts are in the unsatisfiable core [2019-03-04 16:28:00,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:00,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:00,238 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:00,251 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:00,251 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:03,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:03,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 160 [2019-03-04 16:28:03,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-03-04 16:28:03,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-03-04 16:28:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:28:03,764 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2019-03-04 16:28:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:04,283 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-03-04 16:28:04,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-03-04 16:28:04,283 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2019-03-04 16:28:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:04,285 INFO L225 Difference]: With dead ends: 246 [2019-03-04 16:28:04,285 INFO L226 Difference]: Without dead ends: 245 [2019-03-04 16:28:04,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12640 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:28:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-03-04 16:28:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-03-04 16:28:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-03-04 16:28:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-03-04 16:28:04,290 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-03-04 16:28:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:04,290 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-03-04 16:28:04,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-03-04 16:28:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-03-04 16:28:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-03-04 16:28:04,291 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:04,291 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2019-03-04 16:28:04,291 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2019-03-04 16:28:04,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:04,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:04,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:04,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:04,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:07,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:07,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:28:07,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:28:07,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:07,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 250 conjunts are in the unsatisfiable core [2019-03-04 16:28:07,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:07,348 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:07,349 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:07,358 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:07,358 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:10,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:10,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 162 [2019-03-04 16:28:10,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-03-04 16:28:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-03-04 16:28:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:28:10,856 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2019-03-04 16:28:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:11,361 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-03-04 16:28:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 16:28:11,362 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2019-03-04 16:28:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:11,363 INFO L225 Difference]: With dead ends: 249 [2019-03-04 16:28:11,363 INFO L226 Difference]: Without dead ends: 248 [2019-03-04 16:28:11,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12960 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:28:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-03-04 16:28:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-03-04 16:28:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-03-04 16:28:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-03-04 16:28:11,369 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-03-04 16:28:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:11,369 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-03-04 16:28:11,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-03-04 16:28:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-03-04 16:28:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-03-04 16:28:11,370 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:11,370 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2019-03-04 16:28:11,370 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2019-03-04 16:28:11,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:14,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:14,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:14,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:28:14,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-03-04 16:28:14,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:14,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 253 conjunts are in the unsatisfiable core [2019-03-04 16:28:14,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:14,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:14,724 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:14,734 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:14,735 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:18,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:18,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 164 [2019-03-04 16:28:18,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-03-04 16:28:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-03-04 16:28:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:28:18,300 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2019-03-04 16:28:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:18,881 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-03-04 16:28:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 16:28:18,882 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2019-03-04 16:28:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:18,883 INFO L225 Difference]: With dead ends: 252 [2019-03-04 16:28:18,883 INFO L226 Difference]: Without dead ends: 251 [2019-03-04 16:28:18,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13284 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:28:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-03-04 16:28:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-03-04 16:28:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-03-04 16:28:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-03-04 16:28:18,889 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-03-04 16:28:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:18,889 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-03-04 16:28:18,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-03-04 16:28:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-03-04 16:28:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-03-04 16:28:18,890 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:18,891 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2019-03-04 16:28:18,891 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2019-03-04 16:28:18,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:18,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:18,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:21,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:21,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:21,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:28:21,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:28:21,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:21,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 256 conjunts are in the unsatisfiable core [2019-03-04 16:28:21,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:21,981 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:21,981 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:21,988 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:21,988 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:25,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:25,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 166 [2019-03-04 16:28:25,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-03-04 16:28:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-03-04 16:28:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:28:25,674 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2019-03-04 16:28:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:26,196 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-03-04 16:28:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-03-04 16:28:26,196 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2019-03-04 16:28:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:26,198 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:28:26,198 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 16:28:26,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13612 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:28:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 16:28:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-03-04 16:28:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-03-04 16:28:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-03-04 16:28:26,204 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-03-04 16:28:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:26,204 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-03-04 16:28:26,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-03-04 16:28:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-03-04 16:28:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-03-04 16:28:26,205 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:26,205 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2019-03-04 16:28:26,206 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2019-03-04 16:28:26,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:26,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:29,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:29,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:29,271 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:28:29,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-03-04 16:28:29,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:29,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 259 conjunts are in the unsatisfiable core [2019-03-04 16:28:29,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:29,517 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:29,517 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:29,526 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:29,526 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:33,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:33,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 168 [2019-03-04 16:28:33,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-03-04 16:28:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-03-04 16:28:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:28:33,280 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2019-03-04 16:28:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:33,918 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-03-04 16:28:33,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 16:28:33,918 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2019-03-04 16:28:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:33,919 INFO L225 Difference]: With dead ends: 258 [2019-03-04 16:28:33,919 INFO L226 Difference]: Without dead ends: 257 [2019-03-04 16:28:33,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13944 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:28:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-03-04 16:28:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-03-04 16:28:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-03-04 16:28:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-03-04 16:28:33,924 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-03-04 16:28:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:33,924 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-03-04 16:28:33,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-03-04 16:28:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-03-04 16:28:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-03-04 16:28:33,925 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:33,925 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2019-03-04 16:28:33,925 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2019-03-04 16:28:33,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:33,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:33,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:37,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:37,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:37,101 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:28:37,444 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-03-04 16:28:37,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:37,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 262 conjunts are in the unsatisfiable core [2019-03-04 16:28:37,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:37,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:37,455 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:37,463 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:37,463 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:41,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 170 [2019-03-04 16:28:41,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-03-04 16:28:41,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-03-04 16:28:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:28:41,299 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2019-03-04 16:28:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:41,947 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-03-04 16:28:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-03-04 16:28:41,948 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2019-03-04 16:28:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:41,949 INFO L225 Difference]: With dead ends: 261 [2019-03-04 16:28:41,950 INFO L226 Difference]: Without dead ends: 260 [2019-03-04 16:28:41,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:28:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-03-04 16:28:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-03-04 16:28:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-03-04 16:28:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-03-04 16:28:41,956 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-03-04 16:28:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:41,957 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-03-04 16:28:41,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-03-04 16:28:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-03-04 16:28:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-03-04 16:28:41,958 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:41,958 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2019-03-04 16:28:41,958 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2019-03-04 16:28:41,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:41,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:41,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:41,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:41,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:45,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:45,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:45,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 265 conjunts are in the unsatisfiable core [2019-03-04 16:28:45,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:45,287 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:45,287 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:45,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:45,297 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:49,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 172 [2019-03-04 16:28:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-03-04 16:28:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-03-04 16:28:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:28:49,268 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2019-03-04 16:28:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:49,807 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-03-04 16:28:49,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-03-04 16:28:49,808 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2019-03-04 16:28:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:49,809 INFO L225 Difference]: With dead ends: 264 [2019-03-04 16:28:49,810 INFO L226 Difference]: Without dead ends: 263 [2019-03-04 16:28:49,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14620 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:28:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-03-04 16:28:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-03-04 16:28:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-03-04 16:28:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-03-04 16:28:49,816 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-03-04 16:28:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:49,816 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-03-04 16:28:49,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-03-04 16:28:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-03-04 16:28:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-03-04 16:28:49,818 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:49,818 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2019-03-04 16:28:49,818 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2019-03-04 16:28:49,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:49,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:49,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:53,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:53,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:53,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:28:53,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:28:53,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:53,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 268 conjunts are in the unsatisfiable core [2019-03-04 16:28:53,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:53,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:53,410 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:53,431 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:53,432 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:57,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:57,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 174 [2019-03-04 16:28:57,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-03-04 16:28:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-03-04 16:28:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:28:57,469 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2019-03-04 16:28:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:58,066 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-03-04 16:28:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-03-04 16:28:58,066 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2019-03-04 16:28:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:58,068 INFO L225 Difference]: With dead ends: 267 [2019-03-04 16:28:58,068 INFO L226 Difference]: Without dead ends: 266 [2019-03-04 16:28:58,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14964 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:28:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-03-04 16:28:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-03-04 16:28:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-03-04 16:28:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-03-04 16:28:58,075 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-03-04 16:28:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:58,076 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-03-04 16:28:58,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-03-04 16:28:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-03-04 16:28:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-03-04 16:28:58,077 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:58,077 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2019-03-04 16:28:58,077 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:58,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2019-03-04 16:28:58,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:58,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:58,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:58,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:01,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:01,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:29:01,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-03-04 16:29:01,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:01,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 271 conjunts are in the unsatisfiable core [2019-03-04 16:29:01,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:01,939 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:01,939 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:01,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:01,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:06,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:06,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 176 [2019-03-04 16:29:06,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-03-04 16:29:06,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-03-04 16:29:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:29:06,072 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2019-03-04 16:29:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:06,630 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-03-04 16:29:06,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-03-04 16:29:06,631 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2019-03-04 16:29:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:06,632 INFO L225 Difference]: With dead ends: 270 [2019-03-04 16:29:06,632 INFO L226 Difference]: Without dead ends: 269 [2019-03-04 16:29:06,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15312 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:29:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-03-04 16:29:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-03-04 16:29:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-03-04 16:29:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-03-04 16:29:06,638 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-03-04 16:29:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:06,639 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-03-04 16:29:06,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-03-04 16:29:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-03-04 16:29:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-03-04 16:29:06,640 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:06,640 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2019-03-04 16:29:06,640 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2019-03-04 16:29:06,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:06,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:10,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:10,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:10,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:29:10,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:29:10,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:10,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 274 conjunts are in the unsatisfiable core [2019-03-04 16:29:10,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:10,230 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:10,230 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:10,238 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:10,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:14,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:14,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 178 [2019-03-04 16:29:14,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-03-04 16:29:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-03-04 16:29:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:29:14,445 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2019-03-04 16:29:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:15,123 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-03-04 16:29:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 16:29:15,123 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2019-03-04 16:29:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:15,125 INFO L225 Difference]: With dead ends: 273 [2019-03-04 16:29:15,125 INFO L226 Difference]: Without dead ends: 272 [2019-03-04 16:29:15,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15664 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:29:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-03-04 16:29:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-03-04 16:29:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-03-04 16:29:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-03-04 16:29:15,131 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-03-04 16:29:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:15,131 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-03-04 16:29:15,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-03-04 16:29:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-03-04 16:29:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-03-04 16:29:15,132 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:15,132 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2019-03-04 16:29:15,132 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2019-03-04 16:29:15,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:15,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:18,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:18,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:18,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:29:19,044 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-03-04 16:29:19,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:19,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 277 conjunts are in the unsatisfiable core [2019-03-04 16:29:19,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:19,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:19,060 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:19,068 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:19,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:23,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:23,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 180 [2019-03-04 16:29:23,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-03-04 16:29:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-03-04 16:29:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:29:23,378 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2019-03-04 16:29:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:23,967 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-03-04 16:29:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-03-04 16:29:23,967 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2019-03-04 16:29:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:23,969 INFO L225 Difference]: With dead ends: 276 [2019-03-04 16:29:23,969 INFO L226 Difference]: Without dead ends: 275 [2019-03-04 16:29:23,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16020 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:29:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-03-04 16:29:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-03-04 16:29:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-03-04 16:29:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-03-04 16:29:23,975 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-03-04 16:29:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:23,975 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-03-04 16:29:23,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-03-04 16:29:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-03-04 16:29:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-03-04 16:29:23,976 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:23,976 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2019-03-04 16:29:23,977 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:23,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:23,977 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2019-03-04 16:29:23,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:23,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:23,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:27,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:27,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:27,532 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:29:27,921 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-03-04 16:29:27,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:27,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 280 conjunts are in the unsatisfiable core [2019-03-04 16:29:27,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:27,936 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:27,936 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,944 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:32,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:32,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 182 [2019-03-04 16:29:32,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-03-04 16:29:32,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-03-04 16:29:32,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:29:32,381 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2019-03-04 16:29:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:32,986 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-03-04 16:29:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-03-04 16:29:32,987 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2019-03-04 16:29:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:32,988 INFO L225 Difference]: With dead ends: 279 [2019-03-04 16:29:32,989 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 16:29:32,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16380 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:29:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 16:29:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-03-04 16:29:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-03-04 16:29:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-03-04 16:29:32,994 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-03-04 16:29:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:32,994 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-03-04 16:29:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-03-04 16:29:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-03-04 16:29:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-03-04 16:29:32,995 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:32,996 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2019-03-04 16:29:32,996 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:32,996 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2019-03-04 16:29:32,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:32,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:32,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:32,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:32,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:36,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:36,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:36,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 283 conjunts are in the unsatisfiable core [2019-03-04 16:29:36,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:36,739 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:36,739 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,747 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:41,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:41,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 184 [2019-03-04 16:29:41,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-03-04 16:29:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-03-04 16:29:41,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:29:41,234 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2019-03-04 16:29:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:41,940 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-03-04 16:29:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-03-04 16:29:41,941 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2019-03-04 16:29:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:41,942 INFO L225 Difference]: With dead ends: 282 [2019-03-04 16:29:41,943 INFO L226 Difference]: Without dead ends: 281 [2019-03-04 16:29:41,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16744 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:29:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-03-04 16:29:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-03-04 16:29:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-03-04 16:29:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-03-04 16:29:41,949 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-03-04 16:29:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:41,949 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-03-04 16:29:41,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-03-04 16:29:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-03-04 16:29:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-03-04 16:29:41,950 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:41,950 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2019-03-04 16:29:41,951 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:41,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:41,951 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2019-03-04 16:29:41,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:41,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:45,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:45,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:45,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:29:46,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:29:46,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:46,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 286 conjunts are in the unsatisfiable core [2019-03-04 16:29:46,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:46,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:46,037 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,049 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:50,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:50,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 186 [2019-03-04 16:29:50,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-03-04 16:29:50,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-03-04 16:29:50,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:29:50,627 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2019-03-04 16:29:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:51,340 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-03-04 16:29:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 16:29:51,340 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2019-03-04 16:29:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:51,342 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:29:51,342 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 16:29:51,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17112 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:29:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 16:29:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-03-04 16:29:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-03-04 16:29:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-03-04 16:29:51,348 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-03-04 16:29:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:51,349 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-03-04 16:29:51,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-03-04 16:29:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-03-04 16:29:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-03-04 16:29:51,350 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:51,350 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2019-03-04 16:29:51,350 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2019-03-04 16:29:51,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:51,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:51,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:55,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:55,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:55,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:29:55,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-03-04 16:29:55,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:55,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 289 conjunts are in the unsatisfiable core [2019-03-04 16:29:55,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:55,757 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:55,757 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:55,762 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:55,762 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:00,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:00,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 188 [2019-03-04 16:30:00,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-03-04 16:30:00,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-03-04 16:30:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:30:00,427 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2019-03-04 16:30:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:01,195 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2019-03-04 16:30:01,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-03-04 16:30:01,196 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2019-03-04 16:30:01,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:01,198 INFO L225 Difference]: With dead ends: 288 [2019-03-04 16:30:01,198 INFO L226 Difference]: Without dead ends: 287 [2019-03-04 16:30:01,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:30:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-03-04 16:30:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-03-04 16:30:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-03-04 16:30:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-03-04 16:30:01,204 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2019-03-04 16:30:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:01,204 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-03-04 16:30:01,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-03-04 16:30:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-03-04 16:30:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-03-04 16:30:01,205 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:01,205 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2019-03-04 16:30:01,206 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:01,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2019-03-04 16:30:01,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:01,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:01,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:01,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:01,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:05,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:05,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:05,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:30:05,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:30:05,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:05,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 292 conjunts are in the unsatisfiable core [2019-03-04 16:30:05,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:05,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:30:05,316 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:05,325 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:05,325 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:10,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:10,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 190 [2019-03-04 16:30:10,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-03-04 16:30:10,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-03-04 16:30:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13871, Invalid=22801, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 16:30:10,117 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2019-03-04 16:30:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:10,826 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-03-04 16:30:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-03-04 16:30:10,826 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2019-03-04 16:30:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:10,828 INFO L225 Difference]: With dead ends: 291 [2019-03-04 16:30:10,828 INFO L226 Difference]: Without dead ends: 290 [2019-03-04 16:30:10,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17860 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13871, Invalid=22801, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 16:30:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-03-04 16:30:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-03-04 16:30:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-03-04 16:30:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-03-04 16:30:10,834 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2019-03-04 16:30:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:10,834 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-03-04 16:30:10,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-03-04 16:30:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-03-04 16:30:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-03-04 16:30:10,835 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:10,835 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2019-03-04 16:30:10,836 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2019-03-04 16:30:10,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:10,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:10,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:14,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:14,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:30:15,194 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-03-04 16:30:15,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:15,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 295 conjunts are in the unsatisfiable core [2019-03-04 16:30:15,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:15,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:30:15,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:15,215 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:15,215 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:20,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:20,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 192 [2019-03-04 16:30:20,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-03-04 16:30:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-03-04 16:30:20,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14161, Invalid=23281, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:30:20,072 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2019-03-04 16:30:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:20,853 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-03-04 16:30:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-03-04 16:30:20,853 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2019-03-04 16:30:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:20,855 INFO L225 Difference]: With dead ends: 294 [2019-03-04 16:30:20,855 INFO L226 Difference]: Without dead ends: 293 [2019-03-04 16:30:20,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18240 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=14161, Invalid=23281, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:30:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-03-04 16:30:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-03-04 16:30:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-03-04 16:30:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-03-04 16:30:20,861 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2019-03-04 16:30:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:20,861 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-03-04 16:30:20,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-03-04 16:30:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-03-04 16:30:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-03-04 16:30:20,863 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:20,863 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2019-03-04 16:30:20,863 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:20,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:20,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2019-03-04 16:30:20,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:20,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:20,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:24,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:24,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:24,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:30:25,403 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-03-04 16:30:25,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:25,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 298 conjunts are in the unsatisfiable core [2019-03-04 16:30:25,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:25,415 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:30:25,416 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:25,425 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:25,425 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:30,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:30,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 194 [2019-03-04 16:30:30,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-03-04 16:30:30,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-03-04 16:30:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14454, Invalid=23766, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:30:30,413 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2019-03-04 16:30:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:31,121 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-03-04 16:30:31,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 16:30:31,121 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2019-03-04 16:30:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:31,123 INFO L225 Difference]: With dead ends: 297 [2019-03-04 16:30:31,123 INFO L226 Difference]: Without dead ends: 296 [2019-03-04 16:30:31,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18624 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14454, Invalid=23766, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:30:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-03-04 16:30:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-03-04 16:30:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-03-04 16:30:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-03-04 16:30:31,128 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2019-03-04 16:30:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:31,128 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-03-04 16:30:31,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-03-04 16:30:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-03-04 16:30:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-03-04 16:30:31,129 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:31,129 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2019-03-04 16:30:31,130 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:31,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2019-03-04 16:30:31,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:31,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:31,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:35,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:35,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:35,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 301 conjunts are in the unsatisfiable core [2019-03-04 16:30:35,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:35,422 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:30:35,422 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:35,434 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:35,434 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:40,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:40,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 196 [2019-03-04 16:30:40,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-03-04 16:30:40,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-03-04 16:30:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14750, Invalid=24256, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:30:40,505 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2019-03-04 16:30:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:41,259 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-03-04 16:30:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-03-04 16:30:41,260 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2019-03-04 16:30:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:41,262 INFO L225 Difference]: With dead ends: 300 [2019-03-04 16:30:41,262 INFO L226 Difference]: Without dead ends: 299 [2019-03-04 16:30:41,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19012 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14750, Invalid=24256, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:30:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-03-04 16:30:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-03-04 16:30:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-03-04 16:30:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-03-04 16:30:41,268 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2019-03-04 16:30:41,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:41,269 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2019-03-04 16:30:41,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-03-04 16:30:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2019-03-04 16:30:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-03-04 16:30:41,270 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:41,270 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2019-03-04 16:30:41,270 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:41,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2019-03-04 16:30:41,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:41,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:41,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:41,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:41,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:45,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:45,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:45,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:30:45,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:30:45,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:45,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 304 conjunts are in the unsatisfiable core [2019-03-04 16:30:45,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:45,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:30:45,590 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:45,601 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:45,601 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:50,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:50,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 198 [2019-03-04 16:30:50,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-03-04 16:30:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-03-04 16:30:50,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15049, Invalid=24751, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:30:50,838 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2019-03-04 16:30:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:51,527 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-03-04 16:30:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-03-04 16:30:51,528 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2019-03-04 16:30:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:51,530 INFO L225 Difference]: With dead ends: 303 [2019-03-04 16:30:51,530 INFO L226 Difference]: Without dead ends: 302 [2019-03-04 16:30:51,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19404 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15049, Invalid=24751, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:30:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-03-04 16:30:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-03-04 16:30:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-03-04 16:30:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-03-04 16:30:51,536 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2019-03-04 16:30:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:51,537 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-03-04 16:30:51,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-03-04 16:30:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-03-04 16:30:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-03-04 16:30:51,537 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:51,538 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2019-03-04 16:30:51,538 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2019-03-04 16:30:51,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:51,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:51,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:55,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:55,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:55,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:30:56,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-03-04 16:30:56,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:56,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 307 conjunts are in the unsatisfiable core [2019-03-04 16:30:56,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:56,535 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:30:56,535 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:56,544 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:56,544 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:01,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:01,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 200 [2019-03-04 16:31:01,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-03-04 16:31:01,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-03-04 16:31:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:31:01,807 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2019-03-04 16:31:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:02,635 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-03-04 16:31:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:31:02,636 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2019-03-04 16:31:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:02,637 INFO L225 Difference]: With dead ends: 306 [2019-03-04 16:31:02,637 INFO L226 Difference]: Without dead ends: 305 [2019-03-04 16:31:02,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19800 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:31:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-03-04 16:31:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-03-04 16:31:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-03-04 16:31:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2019-03-04 16:31:02,644 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2019-03-04 16:31:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:02,644 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2019-03-04 16:31:02,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-03-04 16:31:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2019-03-04 16:31:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-03-04 16:31:02,646 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:02,646 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2019-03-04 16:31:02,646 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2019-03-04 16:31:02,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:02,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:02,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:06,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:06,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:31:06,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:31:07,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:31:07,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:07,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 102 conjunts are in the unsatisfiable core [2019-03-04 16:31:07,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:07,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:31:07,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [102] total 103 [2019-03-04 16:31:07,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:31:07,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:31:07,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:31:07,279 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 104 states. [2019-03-04 16:31:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:08,199 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-03-04 16:31:08,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:31:08,200 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 303 [2019-03-04 16:31:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:08,200 INFO L225 Difference]: With dead ends: 306 [2019-03-04 16:31:08,201 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:31:08,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:31:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:31:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:31:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:31:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:31:08,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2019-03-04 16:31:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:08,205 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:31:08,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:31:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:31:08,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:31:08,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:31:08,377 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-03-04 16:31:11,650 WARN L181 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-03-04 16:31:11,657 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2019-03-04 16:31:11,657 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2019-03-04 16:31:11,657 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-03-04 16:31:11,657 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-03-04 16:31:11,659 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (= main_q.offset main_p.offset) (<= main_q.offset 0) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-03-04 16:31:11,660 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2019-03-04 16:31:11,660 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2019-03-04 16:31:11,717 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:31:11 BoogieIcfgContainer [2019-03-04 16:31:11,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:31:11,718 INFO L168 Benchmark]: Toolchain (without parser) took 437453.56 ms. Allocated memory was 140.0 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 107.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-03-04 16:31:11,718 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:31:11,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.07 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:31:11,719 INFO L168 Benchmark]: Boogie Preprocessor took 24.88 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:31:11,719 INFO L168 Benchmark]: RCFGBuilder took 276.17 ms. Allocated memory is still 140.0 MB. Free memory was 103.8 MB in the beginning and 93.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:31:11,720 INFO L168 Benchmark]: TraceAbstraction took 437100.86 ms. Allocated memory was 140.0 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 93.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-03-04 16:31:11,721 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.07 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.88 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 276.17 ms. Allocated memory is still 140.0 MB. Free memory was 103.8 MB in the beginning and 93.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 437100.86 ms. Allocated memory was 140.0 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 93.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset == p!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 436.9s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 39.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7526 SDslu, 1 SDs, 0 SdLazy, 28637 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20502 GetRequests, 10301 SyntacticMatches, 0 SemanticMatches, 10201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666798 ImplicationChecksByTransitivity, 354.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 13.8s SatisfiabilityAnalysisTime, 371.5s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 2718 NumberOfCheckSat, 30702 ConstructedInterpolants, 0 QuantifiedInterpolants, 49145164 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 201 InterpolantComputations, 2 PerfectInterpolantSequences, 29802/1020100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...