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-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:53,778 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:53,780 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:53,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:53,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:53,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:53,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:53,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:53,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:53,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:53,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:53,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:53,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:53,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:53,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:53,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:53,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:53,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:53,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:53,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:53,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:53,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:53,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:53,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:53,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:53,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:53,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:53,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:53,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:53,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:53,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:53,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:53,827 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:53,827 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:53,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:53,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:53,831 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:53,845 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:53,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:53,846 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:53,846 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:53,846 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:53,846 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:53,847 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:53,847 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:53,847 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:53,847 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:53,847 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:53,848 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:53,848 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:53,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:53,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:53,849 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:53,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:53,850 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:53,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:53,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:53,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:53,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:53,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:53,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:53,851 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:53,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:53,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:53,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:53,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:53,852 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:53,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:53,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:53,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:53,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:53,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:53,853 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:53,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:53,854 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:53,854 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:53,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:53,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:53,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:53,923 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:53,924 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:53,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-03-04 16:23:53,925 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-03-04 16:23:53,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:53,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:53,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:53,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:53,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:54,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,025 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:23:54,025 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:23:54,025 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:23:54,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:54,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:54,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:54,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:54,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:54,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:54,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:54,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (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,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-03-04 16:23:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:23:54,157 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:23:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-03-04 16:23:54,439 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:23:54,440 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-03-04 16:23:54,441 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:54 BoogieIcfgContainer [2019-03-04 16:23:54,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:54,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:54,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:54,445 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:54,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/2) ... [2019-03-04 16:23:54,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b4cd70 and model type PointerIncrement-simplified01.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,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:54" (2/2) ... [2019-03-04 16:23:54,449 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-03-04 16:23:54,458 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:54,467 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-03-04 16:23:54,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-03-04 16:23:54,515 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:54,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:54,516 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:54,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:54,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:54,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:54,517 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:54,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:54,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-03-04 16:23:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:23:54,549 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:54,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:23:54,553 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-03-04 16:23:54,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,849 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,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:54,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:23:54,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:23:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:23:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:54,882 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-03-04 16:23:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,042 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-03-04 16:23:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:23:55,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:23:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,055 INFO L225 Difference]: With dead ends: 20 [2019-03-04 16:23:55,055 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:23:55,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:23:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:23:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-03-04 16:23:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:23:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-03-04 16:23:55,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-03-04 16:23:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,093 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-03-04 16:23:55,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:23:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-03-04 16:23:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:23:55,094 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:23:55,094 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-03-04 16:23:55,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,210 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:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:55,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:23:55,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:23:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:23:55,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:23:55,214 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-03-04 16:23:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,421 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-03-04 16:23:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:55,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-03-04 16:23:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,422 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:23:55,423 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:23:55,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:23:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-03-04 16:23:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:23:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-03-04 16:23:55,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-03-04 16:23:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,430 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-03-04 16:23:55,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:23:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-03-04 16:23:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:23:55,430 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,431 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:55,431 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-03-04 16:23:55,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:55,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:23:55,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:55,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:55,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:55,485 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-03-04 16:23:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,503 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-03-04 16:23:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:55,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-03-04 16:23:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,508 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:23:55,508 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:23:55,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:23:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-03-04 16:23:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:23:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-03-04 16:23:55,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-03-04 16:23:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,513 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-03-04 16:23:55,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-03-04 16:23:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:23:55,514 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-03-04 16:23:55,514 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-03-04 16:23:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:55,730 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,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:23:55,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:55,841 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,841 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,861 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,861 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:56,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:23:56,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:23:56,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:23:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:56,037 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-03-04 16:23:56,167 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-03-04 16:23:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,409 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-03-04 16:23:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:23:56,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-03-04 16:23:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,410 INFO L225 Difference]: With dead ends: 20 [2019-03-04 16:23:56,410 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:23:56,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:23:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:23:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-03-04 16:23:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:23:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-03-04 16:23:56,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-03-04 16:23:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,417 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-03-04 16:23:56,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:23:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-03-04 16:23:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-03-04 16:23:56,418 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,418 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-03-04 16:23:56,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-03-04 16:23:56,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:56,606 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:56,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:56,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:56,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:56,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2019-03-04 16:23:56,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:56,659 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,659 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,670 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,670 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:57,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:23:57,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:23:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:23:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:57,077 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-03-04 16:23:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:57,397 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-03-04 16:23:57,401 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 10 states. Word has length 15 [2019-03-04 16:23:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:57,403 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:23:57,403 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:23:57,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:23:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-03-04 16:23:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:23:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-03-04 16:23:57,409 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 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,410 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-03-04 16:23:57,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:23:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-03-04 16:23:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-03-04 16:23:57,411 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:57,411 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-03-04 16:23:57,411 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-03-04 16:23:57,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:57,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:57,413 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,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:57,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 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:57,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:57,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 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,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 28 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,723 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,723 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,733 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,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:57,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:23:57,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:23:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:23:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:57,867 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-03-04 16:23:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,143 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-03-04 16:23:58,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:23:58,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-03-04 16:23:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,145 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:23:58,145 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:23:58,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:23:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:23:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-03-04 16:23:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:23:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-03-04 16:23:58,151 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-03-04 16:23:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,151 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-03-04 16:23:58,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:23:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-03-04 16:23:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-03-04 16:23:58,153 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,153 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-03-04 16:23:58,153 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-03-04 16:23:58,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:58,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:58,293 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:58,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:23:58,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:23:58,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:58,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:23:58,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:58,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:58,356 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,365 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,365 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:58,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:23:58,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:23:58,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:23:58,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:58,491 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-03-04 16:23:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,777 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-03-04 16:23:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:23:58,780 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-03-04 16:23:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,782 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:23:58,782 INFO L226 Difference]: Without dead ends: 34 [2019-03-04 16:23:58,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-03-04 16:23:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-03-04 16:23:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:23:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-03-04 16:23:58,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-03-04 16:23:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,790 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-03-04 16:23:58,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:23:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-03-04 16:23:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:23:58,791 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,791 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-03-04 16:23:58,791 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-03-04 16:23:58,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:58,934 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:58,944 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:23:58,986 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-03-04 16:23:58,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:58,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:23:58,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:59,003 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,003 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,017 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,017 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:59,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-03-04 16:23:59,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:23:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:23:59,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:23:59,246 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-03-04 16:23:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:59,654 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-03-04 16:23:59,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:23:59,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-03-04 16:23:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:59,656 INFO L225 Difference]: With dead ends: 40 [2019-03-04 16:23:59,656 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:23:59,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:23:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:23:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-03-04 16:23:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:23:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-03-04 16:23:59,663 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-03-04 16:23:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:59,663 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-03-04 16:23:59,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:23:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-03-04 16:23:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-03-04 16:23:59,664 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,664 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-03-04 16:23:59,664 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:23:59,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-03-04 16:23:59,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:59,976 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:59,985 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:00,075 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-03-04 16:24:00,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:00,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 37 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,086 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,087 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,097 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,097 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:00,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-03-04 16:24:00,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:24:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:24:00,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:24:00,344 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-03-04 16:24:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:00,634 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-03-04 16:24:00,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:24:00,635 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-03-04 16:24:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:00,636 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:24:00,636 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:24:00,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:24:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-03-04 16:24:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:24:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-03-04 16:24:00,644 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-03-04 16:24:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:00,644 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-03-04 16:24:00,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:24:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-03-04 16:24:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-03-04 16:24:00,645 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:00,646 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-03-04 16:24:00,646 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-03-04 16:24:00,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:00,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:00,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:00,851 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:24:00,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 38 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,920 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,921 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,928 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,929 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-03-04 16:24:01,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:24:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:24:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:24:01,366 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-03-04 16:24:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,658 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-03-04 16:24:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:24:01,659 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-03-04 16:24:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,660 INFO L225 Difference]: With dead ends: 50 [2019-03-04 16:24:01,660 INFO L226 Difference]: Without dead ends: 49 [2019-03-04 16:24:01,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:24:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-03-04 16:24:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-03-04 16:24:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:24:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-03-04 16:24:01,669 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-03-04 16:24:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,669 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-03-04 16:24:01,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:24:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-03-04 16:24:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-03-04 16:24:01,670 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,671 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-03-04 16:24:01,671 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-03-04 16:24:01,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:02,417 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:24:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:02,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:02,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:02,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjunts are in the unsatisfiable core [2019-03-04 16:24:02,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,503 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,504 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,514 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,515 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-03-04 16:24:02,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-03-04 16:24:02,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-03-04 16:24:02,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:24:02,749 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-03-04 16:24:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,196 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-03-04 16:24:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:24:03,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-03-04 16:24:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,198 INFO L225 Difference]: With dead ends: 55 [2019-03-04 16:24:03,199 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:24:03,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:24:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:24:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-03-04 16:24:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:24:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-03-04 16:24:03,208 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-03-04 16:24:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,208 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-03-04 16:24:03,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-03-04 16:24:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-03-04 16:24:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-03-04 16:24:03,209 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,210 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-03-04 16:24:03,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-03-04 16:24:03,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:03,558 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:03,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:03,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-03-04 16:24:03,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:03,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2019-03-04 16:24:03,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:03,644 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,645 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,655 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,656 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:03,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-03-04 16:24:03,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-03-04 16:24:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-03-04 16:24:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:24:03,965 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-03-04 16:24:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:04,417 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-03-04 16:24:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:24:04,418 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-03-04 16:24:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:04,419 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:24:04,419 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:24:04,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:24:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:24:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-03-04 16:24:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:24:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-03-04 16:24:04,429 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-03-04 16:24:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:04,430 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-03-04 16:24:04,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-03-04 16:24:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-03-04 16:24:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-03-04 16:24:04,431 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:04,431 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-03-04 16:24:04,431 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-03-04 16:24:04,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:04,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:04,639 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:04,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:04,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:04,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:04,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjunts are in the unsatisfiable core [2019-03-04 16:24:04,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:04,699 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,700 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,710 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,710 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:04,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-03-04 16:24:04,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:24:04,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:24:04,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:04,975 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-03-04 16:24:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:05,386 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-03-04 16:24:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:24:05,387 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-03-04 16:24:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:05,388 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:24:05,388 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:24:05,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:24:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-03-04 16:24:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:24:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-03-04 16:24:05,398 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-03-04 16:24:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:05,398 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-03-04 16:24:05,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:24:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-03-04 16:24:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-03-04 16:24:05,400 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:05,400 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-03-04 16:24:05,400 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:05,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:05,400 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-03-04 16:24:05,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:05,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:05,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:05,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:05,629 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:05,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:05,694 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-03-04 16:24:05,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:05,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:24:05,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:05,711 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,711 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,721 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,721 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:05,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2019-03-04 16:24:05,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-03-04 16:24:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-03-04 16:24:05,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2019-03-04 16:24:05,932 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-03-04 16:24:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:06,444 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-03-04 16:24:06,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:24:06,445 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-03-04 16:24:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:06,446 INFO L225 Difference]: With dead ends: 70 [2019-03-04 16:24:06,446 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:24:06,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:24:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:24:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-03-04 16:24:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:24:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-03-04 16:24:06,457 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-03-04 16:24:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:06,457 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-03-04 16:24:06,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-03-04 16:24:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-03-04 16:24:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-03-04 16:24:06,458 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:06,459 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-03-04 16:24:06,459 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:06,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:06,459 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-03-04 16:24:06,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:06,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:06,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:06,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:07,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:07,518 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:07,533 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:07,591 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-03-04 16:24:07,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:07,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:24:07,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:07,626 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,627 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,631 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,631 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:07,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:07,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2019-03-04 16:24:07,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-03-04 16:24:07,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-03-04 16:24:07,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:24:07,870 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-03-04 16:24:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:08,341 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-03-04 16:24:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-03-04 16:24:08,341 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-03-04 16:24:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:08,342 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:24:08,343 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:24:08,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=645, Invalid=1247, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:24:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:24:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-03-04 16:24:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:24:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-03-04 16:24:08,359 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-03-04 16:24:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:08,360 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-03-04 16:24:08,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-03-04 16:24:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-03-04 16:24:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-03-04 16:24:08,361 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:08,361 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-03-04 16:24:08,361 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-03-04 16:24:08,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:08,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:08,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:08,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,791 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,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:08,792 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:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 56 conjunts are in the unsatisfiable core [2019-03-04 16:24:08,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:08,877 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,877 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,899 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,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:09,296 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:09,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:09,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2019-03-04 16:24:09,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:24:09,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:24:09,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:24:09,316 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-03-04 16:24:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:09,875 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-03-04 16:24:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:24:09,876 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-03-04 16:24:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:09,876 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:24:09,877 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:24:09,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:24:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:24:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-03-04 16:24:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:24:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-03-04 16:24:09,888 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-03-04 16:24:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:09,889 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-03-04 16:24:09,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:24:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-03-04 16:24:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-03-04 16:24:09,890 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:09,890 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-03-04 16:24:09,890 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-03-04 16:24:09,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:09,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:10,210 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:10,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:10,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:10,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:10,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 61 conjunts are in the unsatisfiable core [2019-03-04 16:24:10,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:10,290 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,290 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,300 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,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2019-03-04 16:24:10,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-03-04 16:24:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-03-04 16:24:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:24:10,660 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-03-04 16:24:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:11,303 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-03-04 16:24:11,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:24:11,303 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-03-04 16:24:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:11,304 INFO L225 Difference]: With dead ends: 85 [2019-03-04 16:24:11,304 INFO L226 Difference]: Without dead ends: 84 [2019-03-04 16:24:11,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-03-04 16:24:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-03-04 16:24:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:24:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-03-04 16:24:11,316 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-03-04 16:24:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:11,316 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-03-04 16:24:11,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-03-04 16:24:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-03-04 16:24:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-03-04 16:24:11,317 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:11,317 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-03-04 16:24:11,318 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-03-04 16:24:11,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:11,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:12,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:12,098 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:12,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:12,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-03-04 16:24:12,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:12,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:24:12,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:12,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:12,186 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,195 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,195 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:12,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:12,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2019-03-04 16:24:12,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-03-04 16:24:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-03-04 16:24:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2019-03-04 16:24:12,654 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-03-04 16:24:13,651 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-03-04 16:24:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:13,884 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-03-04 16:24:13,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:24:13,884 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-03-04 16:24:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:13,885 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:24:13,885 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:24:13,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:24:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:24:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-03-04 16:24:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-03-04 16:24:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-03-04 16:24:13,900 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-03-04 16:24:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:13,900 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-03-04 16:24:13,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-03-04 16:24:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-03-04 16:24:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-03-04 16:24:13,901 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:13,901 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-03-04 16:24:13,902 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-03-04 16:24:13,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:13,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:13,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:13,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:14,202 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:14,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:14,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:14,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:14,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:24:14,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:14,274 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,274 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,283 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,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:14,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2019-03-04 16:24:14,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:24:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:24:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:14,632 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-03-04 16:24:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:15,238 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-03-04 16:24:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-03-04 16:24:15,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-03-04 16:24:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:15,239 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:24:15,239 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:24:15,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:24:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:24:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-03-04 16:24:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:24:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-03-04 16:24:15,252 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-03-04 16:24:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:15,252 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-03-04 16:24:15,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:24:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-03-04 16:24:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-03-04 16:24:15,253 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:15,253 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-03-04 16:24:15,253 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-03-04 16:24:15,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:15,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:15,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:15,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:15,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 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:15,606 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:15,697 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-03-04 16:24:15,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:15,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:24:15,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:15,709 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,709 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,717 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,718 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:16,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:16,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2019-03-04 16:24:16,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-03-04 16:24:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-03-04 16:24:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2019-03-04 16:24:16,047 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-03-04 16:24:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:16,658 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-03-04 16:24:16,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:24:16,659 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-03-04 16:24:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:16,660 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:24:16,660 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:24:16,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:24:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:24:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-03-04 16:24:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-03-04 16:24:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-03-04 16:24:16,672 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-03-04 16:24:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:16,673 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-03-04 16:24:16,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-03-04 16:24:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-03-04 16:24:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-03-04 16:24:16,674 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:16,674 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-03-04 16:24:16,674 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:16,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-03-04 16:24:16,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:16,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:17,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:17,063 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:17,071 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:17,156 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-03-04 16:24:17,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:17,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 73 conjunts are in the unsatisfiable core [2019-03-04 16:24:17,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:17,175 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,175 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,181 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,182 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:17,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:17,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2019-03-04 16:24:17,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-03-04 16:24:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-03-04 16:24:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2019-03-04 16:24:17,520 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-03-04 16:24:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:18,355 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-03-04 16:24:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:24:18,355 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-03-04 16:24:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:18,356 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:24:18,356 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:24:18,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:24:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:24:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-03-04 16:24:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:24:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-03-04 16:24:18,372 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-03-04 16:24:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,372 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-03-04 16:24:18,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-03-04 16:24:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-03-04 16:24:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-03-04 16:24:18,373 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,373 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-03-04 16:24:18,373 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-03-04 16:24:18,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:18,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:18,898 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:18,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 74 conjunts are in the unsatisfiable core [2019-03-04 16:24:18,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:19,011 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:19,011 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,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:19,022 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:19,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:19,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2019-03-04 16:24:19,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:24:19,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:24:19,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:24:19,388 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-03-04 16:24:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:20,121 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-03-04 16:24:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-03-04 16:24:20,123 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-03-04 16:24:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:20,124 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:24:20,124 INFO L226 Difference]: Without dead ends: 109 [2019-03-04 16:24:20,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:24:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-03-04 16:24:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-03-04 16:24:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-03-04 16:24:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-03-04 16:24:20,139 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-03-04 16:24:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:20,139 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-03-04 16:24:20,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:24:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-03-04 16:24:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-03-04 16:24:20,139 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:20,140 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-03-04 16:24:20,140 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-03-04 16:24:20,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:20,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:20,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:20,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:21,452 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:21,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:21,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:21,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:21,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 79 conjunts are in the unsatisfiable core [2019-03-04 16:24:21,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:21,549 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,550 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,558 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,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:22,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:22,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2019-03-04 16:24:22,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-03-04 16:24:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-03-04 16:24:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2019-03-04 16:24:22,484 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-03-04 16:24:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:23,445 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-03-04 16:24:23,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-03-04 16:24:23,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-03-04 16:24:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:23,447 INFO L225 Difference]: With dead ends: 115 [2019-03-04 16:24:23,447 INFO L226 Difference]: Without dead ends: 114 [2019-03-04 16:24:23,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:24:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-03-04 16:24:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-03-04 16:24:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-03-04 16:24:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-03-04 16:24:23,460 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-03-04 16:24:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:23,460 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-03-04 16:24:23,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-03-04 16:24:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-03-04 16:24:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-03-04 16:24:23,461 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:23,462 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-03-04 16:24:23,462 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-03-04 16:24:23,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:23,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:23,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:23,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:23,856 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:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:23,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-03-04 16:24:23,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:23,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 82 conjunts are in the unsatisfiable core [2019-03-04 16:24:23,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:24,028 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,029 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,122 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,122 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:24,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:24,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2019-03-04 16:24:24,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-03-04 16:24:24,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-03-04 16:24:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2019-03-04 16:24:24,628 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-03-04 16:24:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:25,622 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-03-04 16:24:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:24:25,622 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-03-04 16:24:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:25,623 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:24:25,623 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:24:25,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1680, Invalid=3290, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:24:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:24:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-03-04 16:24:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-03-04 16:24:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-03-04 16:24:25,641 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-03-04 16:24:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:25,641 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-03-04 16:24:25,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-03-04 16:24:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-03-04 16:24:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-03-04 16:24:25,642 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:25,642 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-03-04 16:24:25,643 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-03-04 16:24:25,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:25,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:25,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,072 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:26,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:26,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:26,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:26,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 85 conjunts are in the unsatisfiable core [2019-03-04 16:24:26,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:26,164 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:26,164 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,176 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,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:26,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2019-03-04 16:24:26,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:24:26,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:24:26,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:26,697 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-03-04 16:24:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:27,583 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-03-04 16:24:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:24:27,584 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-03-04 16:24:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:27,584 INFO L225 Difference]: With dead ends: 125 [2019-03-04 16:24:27,584 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:24:27,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:24:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:24:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-03-04 16:24:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:24:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-03-04 16:24:27,598 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-03-04 16:24:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:27,598 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-03-04 16:24:27,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:24:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-03-04 16:24:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-03-04 16:24:27,599 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:27,599 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-03-04 16:24:27,599 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-03-04 16:24:27,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:27,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:28,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:28,422 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:28,431 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:28,539 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-03-04 16:24:28,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:28,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 88 conjunts are in the unsatisfiable core [2019-03-04 16:24:28,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:28,554 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:28,554 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,563 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:28,564 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:29,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:29,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2019-03-04 16:24:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-03-04 16:24:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-03-04 16:24:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2019-03-04 16:24:29,059 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-03-04 16:24:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:30,081 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-03-04 16:24:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:24:30,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-03-04 16:24:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:30,082 INFO L225 Difference]: With dead ends: 130 [2019-03-04 16:24:30,082 INFO L226 Difference]: Without dead ends: 129 [2019-03-04 16:24:30,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:24:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-03-04 16:24:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-03-04 16:24:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-03-04 16:24:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-03-04 16:24:30,098 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-03-04 16:24:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:30,099 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-03-04 16:24:30,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-03-04 16:24:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-03-04 16:24:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-03-04 16:24:30,099 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:30,099 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-03-04 16:24:30,100 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:30,100 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-03-04 16:24:30,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:30,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:30,605 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:30,614 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:30,736 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-03-04 16:24:30,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:30,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:24:30,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:30,768 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:30,768 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,781 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:30,782 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:31,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:31,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2019-03-04 16:24:31,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-03-04 16:24:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-03-04 16:24:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2019-03-04 16:24:31,289 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-03-04 16:24:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:32,261 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-03-04 16:24:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-03-04 16:24:32,261 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-03-04 16:24:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:32,262 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:24:32,262 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:24:32,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:24:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:24:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-03-04 16:24:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-03-04 16:24:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-03-04 16:24:32,283 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-03-04 16:24:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:32,283 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-03-04 16:24:32,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-03-04 16:24:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-03-04 16:24:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-03-04 16:24:32,284 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:32,284 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-03-04 16:24:32,285 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-03-04 16:24:32,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:33,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:33,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 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:33,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 92 conjunts are in the unsatisfiable core [2019-03-04 16:24:33,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:33,696 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,696 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,705 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,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:34,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:34,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2019-03-04 16:24:34,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-03-04 16:24:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-03-04 16:24:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:24:34,257 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-03-04 16:24:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:35,301 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-03-04 16:24:35,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:24:35,301 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-03-04 16:24:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:35,302 INFO L225 Difference]: With dead ends: 140 [2019-03-04 16:24:35,302 INFO L226 Difference]: Without dead ends: 139 [2019-03-04 16:24:35,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:24:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-03-04 16:24:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-03-04 16:24:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:24:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-03-04 16:24:35,322 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-03-04 16:24:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:35,322 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-03-04 16:24:35,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-03-04 16:24:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-03-04 16:24:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:24:35,323 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:35,323 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-03-04 16:24:35,323 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:35,324 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-03-04 16:24:35,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:35,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:35,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:35,986 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:35,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:36,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:36,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:36,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 97 conjunts are in the unsatisfiable core [2019-03-04 16:24:36,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:36,112 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:36,112 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,214 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:36,215 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:37,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:37,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2019-03-04 16:24:37,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-03-04 16:24:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-03-04 16:24:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:24:37,660 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-03-04 16:24:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:38,829 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-03-04 16:24:38,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:24:38,830 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-03-04 16:24:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:38,831 INFO L225 Difference]: With dead ends: 145 [2019-03-04 16:24:38,831 INFO L226 Difference]: Without dead ends: 144 [2019-03-04 16:24:38,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:24:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-03-04 16:24:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-03-04 16:24:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-03-04 16:24:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-03-04 16:24:38,860 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-03-04 16:24:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:38,860 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-03-04 16:24:38,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-03-04 16:24:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-03-04 16:24:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-03-04 16:24:38,861 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:38,861 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-03-04 16:24:38,862 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-03-04 16:24:38,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:39,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:39,468 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:39,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:39,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-03-04 16:24:39,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:39,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 100 conjunts are in the unsatisfiable core [2019-03-04 16:24:39,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:39,633 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:39,633 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,642 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:39,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:40,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:40,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2019-03-04 16:24:40,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-03-04 16:24:40,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-03-04 16:24:40,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:24:40,392 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-03-04 16:24:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:41,580 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-03-04 16:24:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:24:41,581 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-03-04 16:24:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:41,582 INFO L225 Difference]: With dead ends: 150 [2019-03-04 16:24:41,583 INFO L226 Difference]: Without dead ends: 149 [2019-03-04 16:24:41,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:24:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-03-04 16:24:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-03-04 16:24:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-03-04 16:24:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-03-04 16:24:41,601 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-03-04 16:24:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:41,601 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-03-04 16:24:41,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-03-04 16:24:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-03-04 16:24:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-03-04 16:24:41,602 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:41,602 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-03-04 16:24:41,602 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-03-04 16:24:41,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:41,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:43,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:43,222 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:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:43,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:43,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:43,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:24:43,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:43,337 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:43,338 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,348 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:43,348 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:44,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:44,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2019-03-04 16:24:44,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-03-04 16:24:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-03-04 16:24:44,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:24:44,298 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-03-04 16:24:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:45,597 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-03-04 16:24:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-03-04 16:24:45,598 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-03-04 16:24:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:45,599 INFO L225 Difference]: With dead ends: 155 [2019-03-04 16:24:45,599 INFO L226 Difference]: Without dead ends: 154 [2019-03-04 16:24:45,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:24:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-03-04 16:24:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-03-04 16:24:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-03-04 16:24:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-03-04 16:24:45,619 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-03-04 16:24:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:45,620 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-03-04 16:24:45,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-03-04 16:24:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-03-04 16:24:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-03-04 16:24:45,621 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:45,621 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-03-04 16:24:45,621 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:45,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:45,621 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-03-04 16:24:45,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:45,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:45,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:46,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,331 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:46,341 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:46,482 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-03-04 16:24:46,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:46,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 106 conjunts are in the unsatisfiable core [2019-03-04 16:24:46,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:46,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:24:46,491 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,502 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,503 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:47,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:47,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2019-03-04 16:24:47,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-03-04 16:24:47,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-03-04 16:24:47,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2019-03-04 16:24:47,320 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-03-04 16:24:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:48,830 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-03-04 16:24:48,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:24:48,831 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-03-04 16:24:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:48,832 INFO L225 Difference]: With dead ends: 160 [2019-03-04 16:24:48,832 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:24:48,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:24:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:24:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-03-04 16:24:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-03-04 16:24:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-03-04 16:24:48,859 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-03-04 16:24:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:48,859 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-03-04 16:24:48,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-03-04 16:24:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-03-04 16:24:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-03-04 16:24:48,862 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:48,862 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-03-04 16:24:48,863 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-03-04 16:24:48,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:49,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:49,610 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:49,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:49,774 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-03-04 16:24:49,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:49,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 109 conjunts are in the unsatisfiable core [2019-03-04 16:24:49,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:49,785 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:49,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,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:49,793 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:50,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:50,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2019-03-04 16:24:50,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-03-04 16:24:50,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-03-04 16:24:50,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:24:50,526 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-03-04 16:24:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:51,923 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-03-04 16:24:51,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:24:51,924 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-03-04 16:24:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:51,926 INFO L225 Difference]: With dead ends: 165 [2019-03-04 16:24:51,926 INFO L226 Difference]: Without dead ends: 164 [2019-03-04 16:24:51,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:24:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-03-04 16:24:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-03-04 16:24:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:24:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-03-04 16:24:51,952 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-03-04 16:24:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:51,952 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-03-04 16:24:51,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-03-04 16:24:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-03-04 16:24:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-03-04 16:24:51,953 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:51,953 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-03-04 16:24:51,954 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-03-04 16:24:51,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:51,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:52,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:52,739 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:52,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 110 conjunts are in the unsatisfiable core [2019-03-04 16:24:52,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:52,865 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:52,865 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,876 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:52,876 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:54,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:54,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2019-03-04 16:24:54,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-03-04 16:24:54,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-03-04 16:24:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:24:54,030 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-03-04 16:24:54,741 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-03-04 16:24:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:55,822 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-03-04 16:24:55,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:24:55,822 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-03-04 16:24:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:55,824 INFO L225 Difference]: With dead ends: 170 [2019-03-04 16:24:55,824 INFO L226 Difference]: Without dead ends: 169 [2019-03-04 16:24:55,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:24:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-03-04 16:24:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-03-04 16:24:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-03-04 16:24:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-03-04 16:24:55,856 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-03-04 16:24:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:55,856 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-03-04 16:24:55,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-03-04 16:24:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-03-04 16:24:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-03-04 16:24:55,857 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:55,857 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-03-04 16:24:55,858 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-03-04 16:24:55,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:55,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:55,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:55,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:56,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:56,928 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:56,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:57,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:57,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:57,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:24:57,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:57,062 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,062 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,076 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,076 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:57,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:57,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2019-03-04 16:24:57,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-03-04 16:24:57,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-03-04 16:24:57,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:24:57,888 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-03-04 16:24:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:59,475 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-03-04 16:24:59,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:24:59,476 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-03-04 16:24:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:59,477 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:24:59,477 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:24:59,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:24:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:24:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-03-04 16:24:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-03-04 16:24:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-03-04 16:24:59,500 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-03-04 16:24:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:59,500 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-03-04 16:24:59,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-03-04 16:24:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-03-04 16:24:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-03-04 16:24:59,501 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:59,501 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-03-04 16:24:59,502 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:24:59,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:59,502 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-03-04 16:24:59,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:59,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:59,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:59,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:00,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:00,372 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:25:00,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:00,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-03-04 16:25:00,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:00,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 118 conjunts are in the unsatisfiable core [2019-03-04 16:25:00,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:00,570 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:00,570 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,578 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:00,579 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:01,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:01,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2019-03-04 16:25:01,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-03-04 16:25:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-03-04 16:25:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2019-03-04 16:25:01,402 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-03-04 16:25:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:02,882 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-03-04 16:25:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-03-04 16:25:02,882 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-03-04 16:25:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:02,883 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:25:02,883 INFO L226 Difference]: Without dead ends: 179 [2019-03-04 16:25:02,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:25:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-03-04 16:25:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-03-04 16:25:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-03-04 16:25:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-03-04 16:25:02,913 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-03-04 16:25:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:02,913 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-03-04 16:25:02,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-03-04 16:25:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-03-04 16:25:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-03-04 16:25:02,914 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:02,915 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-03-04 16:25:02,915 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-03-04 16:25:02,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:02,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:04,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:04,350 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:25:04,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:04,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:04,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:04,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 121 conjunts are in the unsatisfiable core [2019-03-04 16:25:04,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:04,504 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,505 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,594 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,595 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:05,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:05,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2019-03-04 16:25:05,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:25:05,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:25:05,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:25:05,496 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-03-04 16:25:06,886 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-03-04 16:25:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:07,726 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-03-04 16:25:07,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:25:07,726 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-03-04 16:25:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:07,728 INFO L225 Difference]: With dead ends: 185 [2019-03-04 16:25:07,728 INFO L226 Difference]: Without dead ends: 184 [2019-03-04 16:25:07,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:25:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-03-04 16:25:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-03-04 16:25:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-03-04 16:25:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-03-04 16:25:07,755 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-03-04 16:25:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:07,755 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-03-04 16:25:07,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:25:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-03-04 16:25:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-03-04 16:25:07,756 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:07,757 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-03-04 16:25:07,757 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-03-04 16:25:07,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:07,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:07,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:07,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:08,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:08,672 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:25:08,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:25:08,859 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-03-04 16:25:08,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:08,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 124 conjunts are in the unsatisfiable core [2019-03-04 16:25:08,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:08,899 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:08,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,001 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:09,001 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2019-03-04 16:25:10,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-03-04 16:25:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-03-04 16:25:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2019-03-04 16:25:10,104 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-03-04 16:25:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:11,669 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-03-04 16:25:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:25:11,670 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-03-04 16:25:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:11,671 INFO L225 Difference]: With dead ends: 190 [2019-03-04 16:25:11,671 INFO L226 Difference]: Without dead ends: 189 [2019-03-04 16:25:11,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:25:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-03-04 16:25:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-03-04 16:25:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-03-04 16:25:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-03-04 16:25:11,698 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-03-04 16:25:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:11,699 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-03-04 16:25:11,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-03-04 16:25:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-03-04 16:25:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-03-04 16:25:11,700 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:11,700 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-03-04 16:25:11,700 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-03-04 16:25:11,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:11,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:11,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:12,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:12,570 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:25:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:12,787 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-03-04 16:25:12,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:12,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 127 conjunts are in the unsatisfiable core [2019-03-04 16:25:12,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:12,828 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:12,829 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,918 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:12,918 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:15,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:15,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2019-03-04 16:25:15,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-03-04 16:25:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-03-04 16:25:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:25:15,145 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-03-04 16:25:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:16,794 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-03-04 16:25:16,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-03-04 16:25:16,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-03-04 16:25:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:16,795 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:25:16,796 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:25:16,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:25:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:25:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-03-04 16:25:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-03-04 16:25:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-03-04 16:25:16,836 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-03-04 16:25:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:16,836 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-03-04 16:25:16,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-03-04 16:25:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-03-04 16:25:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-03-04 16:25:16,837 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:16,837 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-03-04 16:25:16,838 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:16,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-03-04 16:25:16,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:16,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:16,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:16,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:17,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:17,862 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:25:17,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 128 conjunts are in the unsatisfiable core [2019-03-04 16:25:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:17,992 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,992 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,002 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:18,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:19,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:19,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2019-03-04 16:25:19,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:25:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:25:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:25:19,044 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-03-04 16:25:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:20,907 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-03-04 16:25:20,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-03-04 16:25:20,908 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-03-04 16:25:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:20,909 INFO L225 Difference]: With dead ends: 200 [2019-03-04 16:25:20,909 INFO L226 Difference]: Without dead ends: 199 [2019-03-04 16:25:20,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:25:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-03-04 16:25:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-03-04 16:25:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-03-04 16:25:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-03-04 16:25:20,944 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-03-04 16:25:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:20,944 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-03-04 16:25:20,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:25:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-03-04 16:25:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-03-04 16:25:20,945 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:20,945 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-03-04 16:25:20,945 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:20,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-03-04 16:25:20,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:20,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:20,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:22,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:22,469 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:25:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:22,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:22,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:22,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 133 conjunts are in the unsatisfiable core [2019-03-04 16:25:22,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:22,618 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:22,618 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,629 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:22,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:23,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:23,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2019-03-04 16:25:23,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-03-04 16:25:23,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-03-04 16:25:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2019-03-04 16:25:23,753 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-03-04 16:25:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:25,751 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-03-04 16:25:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-03-04 16:25:25,751 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-03-04 16:25:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:25,752 INFO L225 Difference]: With dead ends: 205 [2019-03-04 16:25:25,752 INFO L226 Difference]: Without dead ends: 204 [2019-03-04 16:25:25,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:25:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-03-04 16:25:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-03-04 16:25:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-03-04 16:25:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-03-04 16:25:25,785 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-03-04 16:25:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:25,786 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-03-04 16:25:25,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-03-04 16:25:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-03-04 16:25:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-03-04 16:25:25,786 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:25,786 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-03-04 16:25:25,787 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-03-04 16:25:25,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:25,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:27,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:27,238 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:25:27,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:27,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-03-04 16:25:27,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:27,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 136 conjunts are in the unsatisfiable core [2019-03-04 16:25:27,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:27,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:25:27,536 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,545 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,545 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:28,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:28,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2019-03-04 16:25:28,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-03-04 16:25:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-03-04 16:25:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2019-03-04 16:25:28,632 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-03-04 16:25:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:30,623 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-03-04 16:25:30,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:25:30,623 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-03-04 16:25:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:30,624 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:25:30,625 INFO L226 Difference]: Without dead ends: 209 [2019-03-04 16:25:30,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:25:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-03-04 16:25:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-03-04 16:25:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-03-04 16:25:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-03-04 16:25:30,656 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-03-04 16:25:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:30,657 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-03-04 16:25:30,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-03-04 16:25:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-03-04 16:25:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-03-04 16:25:30,657 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:30,658 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-03-04 16:25:30,658 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-03-04 16:25:30,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:30,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:30,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:30,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:31,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:31,679 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:25:31,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:31,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:31,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:31,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 16:25:31,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:31,824 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,824 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,832 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,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:33,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:33,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2019-03-04 16:25:33,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:25:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:25:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:25:33,003 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-03-04 16:25:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:35,162 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-03-04 16:25:35,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-03-04 16:25:35,162 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-03-04 16:25:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:35,163 INFO L225 Difference]: With dead ends: 215 [2019-03-04 16:25:35,163 INFO L226 Difference]: Without dead ends: 214 [2019-03-04 16:25:35,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5461, Invalid=10795, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:25:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-03-04 16:25:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-03-04 16:25:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-03-04 16:25:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-03-04 16:25:35,211 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-03-04 16:25:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:35,212 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-03-04 16:25:35,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:25:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-03-04 16:25:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-03-04 16:25:35,213 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:35,213 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-03-04 16:25:35,213 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:35,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-03-04 16:25:35,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:35,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:35,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:35,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:35,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:36,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:36,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 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:25:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:25:36,890 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-03-04 16:25:36,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:36,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 142 conjunts are in the unsatisfiable core [2019-03-04 16:25:36,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:36,927 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:36,928 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,940 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:36,941 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:38,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:38,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2019-03-04 16:25:38,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-03-04 16:25:38,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-03-04 16:25:38,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2019-03-04 16:25:38,189 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-03-04 16:25:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:40,416 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-03-04 16:25:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-03-04 16:25:40,416 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-03-04 16:25:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:40,417 INFO L225 Difference]: With dead ends: 220 [2019-03-04 16:25:40,417 INFO L226 Difference]: Without dead ends: 219 [2019-03-04 16:25:40,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:25:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-03-04 16:25:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-03-04 16:25:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-03-04 16:25:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-03-04 16:25:40,450 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-03-04 16:25:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:40,450 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-03-04 16:25:40,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-03-04 16:25:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-03-04 16:25:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-03-04 16:25:40,451 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:40,451 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-03-04 16:25:40,451 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-03-04 16:25:40,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:40,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:40,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:41,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:41,528 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:25:41,538 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:41,806 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-03-04 16:25:41,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:41,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 145 conjunts are in the unsatisfiable core [2019-03-04 16:25:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:41,825 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:41,825 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,837 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:41,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:43,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:43,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2019-03-04 16:25:43,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-03-04 16:25:43,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-03-04 16:25:43,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2019-03-04 16:25:43,057 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-03-04 16:25:43,428 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-03-04 16:25:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:45,964 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-03-04 16:25:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:25:45,964 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-03-04 16:25:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:45,965 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:25:45,965 INFO L226 Difference]: Without dead ends: 224 [2019-03-04 16:25:45,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:25:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-03-04 16:25:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-03-04 16:25:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:25:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-03-04 16:25:46,001 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-03-04 16:25:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:46,001 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-03-04 16:25:46,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-03-04 16:25:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-03-04 16:25:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-03-04 16:25:46,002 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:46,002 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-03-04 16:25:46,003 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:46,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:46,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-03-04 16:25:46,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:46,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:46,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:46,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:46,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:47,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:47,479 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:47,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:47,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 146 conjunts are in the unsatisfiable core [2019-03-04 16:25:47,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:47,628 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:47,628 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,639 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:47,640 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:48,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:48,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2019-03-04 16:25:48,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:25:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:25:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:25:48,963 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-03-04 16:25:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:51,306 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-03-04 16:25:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:25:51,307 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-03-04 16:25:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:51,308 INFO L225 Difference]: With dead ends: 230 [2019-03-04 16:25:51,308 INFO L226 Difference]: Without dead ends: 229 [2019-03-04 16:25:51,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:25:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-03-04 16:25:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-03-04 16:25:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-03-04 16:25:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-03-04 16:25:51,353 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-03-04 16:25:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:51,353 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-03-04 16:25:51,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:25:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-03-04 16:25:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-03-04 16:25:51,354 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:51,354 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-03-04 16:25:51,355 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-03-04 16:25:51,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:51,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:51,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:51,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:52,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:52,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 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:52,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:52,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:52,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:52,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 151 conjunts are in the unsatisfiable core [2019-03-04 16:25:52,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:52,729 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:52,729 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:52,737 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:52,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:54,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:54,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2019-03-04 16:25:54,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-03-04 16:25:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-03-04 16:25:54,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:25:54,336 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-03-04 16:25:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:56,802 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-03-04 16:25:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-03-04 16:25:56,803 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-03-04 16:25:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:56,804 INFO L225 Difference]: With dead ends: 235 [2019-03-04 16:25:56,804 INFO L226 Difference]: Without dead ends: 234 [2019-03-04 16:25:56,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:25:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-03-04 16:25:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-03-04 16:25:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-03-04 16:25:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-03-04 16:25:56,862 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-03-04 16:25:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:56,862 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-03-04 16:25:56,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-03-04 16:25:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-03-04 16:25:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-03-04 16:25:56,864 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:56,864 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-03-04 16:25:56,864 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:25:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-03-04 16:25:56,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:56,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:56,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:56,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:58,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:58,313 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:58,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:58,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-03-04 16:25:58,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:58,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 154 conjunts are in the unsatisfiable core [2019-03-04 16:25:58,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:58,630 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:58,630 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:58,642 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:58,642 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:00,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:00,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2019-03-04 16:26:00,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-03-04 16:26:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-03-04 16:26:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2019-03-04 16:26:00,020 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-03-04 16:26:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:02,401 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-03-04 16:26:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:26:02,401 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-03-04 16:26:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:02,402 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:26:02,403 INFO L226 Difference]: Without dead ends: 239 [2019-03-04 16:26:02,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:26:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-03-04 16:26:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-03-04 16:26:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-03-04 16:26:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-03-04 16:26:02,457 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-03-04 16:26:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:02,457 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-03-04 16:26:02,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-03-04 16:26:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-03-04 16:26:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-03-04 16:26:02,458 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:02,458 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-03-04 16:26:02,459 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-03-04 16:26:02,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:02,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:02,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:02,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:02,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:04,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:04,149 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:26:04,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:26:04,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:26:04,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:04,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 157 conjunts are in the unsatisfiable core [2019-03-04 16:26:04,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:04,318 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:04,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,331 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:04,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:06,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:06,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2019-03-04 16:26:06,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-03-04 16:26:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-03-04 16:26:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:26:06,101 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-03-04 16:26:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:08,520 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-03-04 16:26:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:26:08,523 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-03-04 16:26:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:08,524 INFO L225 Difference]: With dead ends: 245 [2019-03-04 16:26:08,524 INFO L226 Difference]: Without dead ends: 244 [2019-03-04 16:26:08,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:26:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-03-04 16:26:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-03-04 16:26:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:26:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-03-04 16:26:08,579 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-03-04 16:26:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:08,579 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-03-04 16:26:08,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-03-04 16:26:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-03-04 16:26:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:26:08,581 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:08,581 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-03-04 16:26:08,581 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-03-04 16:26:08,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:08,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:08,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:10,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:10,095 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:26:10,103 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:26:10,377 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-03-04 16:26:10,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:10,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 160 conjunts are in the unsatisfiable core [2019-03-04 16:26:10,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:10,390 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:10,390 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:10,400 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:10,400 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:11,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:11,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2019-03-04 16:26:11,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-03-04 16:26:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-03-04 16:26:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2019-03-04 16:26:11,987 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-03-04 16:26:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:14,404 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-03-04 16:26:14,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:26:14,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-03-04 16:26:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:14,406 INFO L225 Difference]: With dead ends: 250 [2019-03-04 16:26:14,406 INFO L226 Difference]: Without dead ends: 249 [2019-03-04 16:26:14,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2019-03-04 16:26:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-03-04 16:26:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-03-04 16:26:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-03-04 16:26:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-03-04 16:26:14,448 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-03-04 16:26:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:14,449 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-03-04 16:26:14,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-03-04 16:26:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-03-04 16:26:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-03-04 16:26:14,450 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:14,450 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-03-04 16:26:14,450 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:14,450 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-03-04 16:26:14,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:14,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:14,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:16,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:16,446 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:26:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:26:16,762 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-03-04 16:26:16,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:16,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:26:16,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:16,779 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,780 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,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:26:16,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:18,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:18,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2019-03-04 16:26:18,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-03-04 16:26:18,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-03-04 16:26:18,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:26:18,498 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-03-04 16:26:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:21,367 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-03-04 16:26:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-03-04 16:26:21,367 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-03-04 16:26:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:21,368 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:26:21,368 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 16:26:21,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:26:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 16:26:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-03-04 16:26:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-03-04 16:26:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-03-04 16:26:21,435 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-03-04 16:26:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:21,435 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-03-04 16:26:21,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-03-04 16:26:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-03-04 16:26:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-03-04 16:26:21,439 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:21,439 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-03-04 16:26:21,439 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:21,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:21,439 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-03-04 16:26:21,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:21,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:21,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:21,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:21,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:22,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:22,745 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:26:22,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:22,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 164 conjunts are in the unsatisfiable core [2019-03-04 16:26:22,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:22,910 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,910 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,918 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,918 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:24,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:24,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2019-03-04 16:26:24,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:26:24,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:26:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:26:24,629 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-03-04 16:26:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:27,397 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-03-04 16:26:27,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:26:27,397 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-03-04 16:26:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:27,399 INFO L225 Difference]: With dead ends: 260 [2019-03-04 16:26:27,399 INFO L226 Difference]: Without dead ends: 259 [2019-03-04 16:26:27,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:26:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-03-04 16:26:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-03-04 16:26:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-03-04 16:26:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-03-04 16:26:27,455 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-03-04 16:26:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:27,455 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-03-04 16:26:27,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:26:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-03-04 16:26:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-03-04 16:26:27,457 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:27,457 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-03-04 16:26:27,457 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-03-04 16:26:27,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:27,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:27,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:28,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:28,869 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:26:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:29,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:29,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:29,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 169 conjunts are in the unsatisfiable core [2019-03-04 16:26:29,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:29,059 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:29,059 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,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:26:29,067 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:30,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:30,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2019-03-04 16:26:30,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-03-04 16:26:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-03-04 16:26:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:26:30,772 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-03-04 16:26:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:33,523 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-03-04 16:26:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:26:33,524 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-03-04 16:26:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:33,525 INFO L225 Difference]: With dead ends: 265 [2019-03-04 16:26:33,525 INFO L226 Difference]: Without dead ends: 264 [2019-03-04 16:26:33,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:26:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-03-04 16:26:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-03-04 16:26:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-03-04 16:26:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-03-04 16:26:33,573 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-03-04 16:26:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:33,573 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-03-04 16:26:33,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-03-04 16:26:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-03-04 16:26:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-03-04 16:26:33,574 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:33,575 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-03-04 16:26:33,575 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-03-04 16:26:33,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:33,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:33,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:35,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:35,025 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:26:35,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:35,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-03-04 16:26:35,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:35,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 172 conjunts are in the unsatisfiable core [2019-03-04 16:26:35,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:35,398 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:35,398 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,402 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:35,402 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:37,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:37,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2019-03-04 16:26:37,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-03-04 16:26:37,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-03-04 16:26:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2019-03-04 16:26:37,460 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-03-04 16:26:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:40,230 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-03-04 16:26:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:26:40,230 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-03-04 16:26:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:40,231 INFO L225 Difference]: With dead ends: 270 [2019-03-04 16:26:40,232 INFO L226 Difference]: Without dead ends: 269 [2019-03-04 16:26:40,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:26:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-03-04 16:26:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-03-04 16:26:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-03-04 16:26:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-03-04 16:26:40,290 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-03-04 16:26:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:40,290 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-03-04 16:26:40,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-03-04 16:26:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-03-04 16:26:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-03-04 16:26:40,291 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:40,291 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-03-04 16:26:40,291 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-03-04 16:26:40,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:40,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:40,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:41,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:41,997 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:26:42,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:26:42,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:26:42,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:42,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 175 conjunts are in the unsatisfiable core [2019-03-04 16:26:42,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:42,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:26:42,186 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,194 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:42,195 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:43,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:43,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2019-03-04 16:26:43,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-03-04 16:26:43,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-03-04 16:26:43,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:26:43,963 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-03-04 16:26:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:47,078 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-03-04 16:26:47,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-03-04 16:26:47,078 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-03-04 16:26:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:47,079 INFO L225 Difference]: With dead ends: 275 [2019-03-04 16:26:47,079 INFO L226 Difference]: Without dead ends: 274 [2019-03-04 16:26:47,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:26:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-03-04 16:26:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-03-04 16:26:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-03-04 16:26:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-03-04 16:26:47,130 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-03-04 16:26:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:47,131 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-03-04 16:26:47,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-03-04 16:26:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-03-04 16:26:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-03-04 16:26:47,132 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:47,132 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-03-04 16:26:47,132 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-03-04 16:26:47,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:47,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:47,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:47,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:47,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:48,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:48,628 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:26:48,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:26:48,954 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-03-04 16:26:48,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:48,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 178 conjunts are in the unsatisfiable core [2019-03-04 16:26:48,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:48,968 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,968 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,977 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,977 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:50,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:50,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2019-03-04 16:26:50,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-03-04 16:26:50,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-03-04 16:26:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2019-03-04 16:26:50,873 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-03-04 16:26:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:53,980 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-03-04 16:26:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:26:53,981 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-03-04 16:26:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:53,982 INFO L225 Difference]: With dead ends: 280 [2019-03-04 16:26:53,982 INFO L226 Difference]: Without dead ends: 279 [2019-03-04 16:26:53,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:26:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-03-04 16:26:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-03-04 16:26:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-03-04 16:26:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-03-04 16:26:54,040 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-03-04 16:26:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:54,041 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-03-04 16:26:54,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-03-04 16:26:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-03-04 16:26:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-03-04 16:26:54,042 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:54,042 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-03-04 16:26:54,043 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:26:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-03-04 16:26:54,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:54,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:54,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:54,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:54,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:55,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:55,770 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:26:55,777 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:26:56,178 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-03-04 16:26:56,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:56,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 181 conjunts are in the unsatisfiable core [2019-03-04 16:26:56,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:56,191 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:56,192 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,202 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:56,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:58,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:58,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2019-03-04 16:26:58,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-03-04 16:26:58,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-03-04 16:26:58,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:26:58,407 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-03-04 16:27:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:01,548 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-03-04 16:27:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:27:01,549 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-03-04 16:27:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:01,550 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:27:01,550 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 16:27:01,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:27:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 16:27:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-03-04 16:27:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-03-04 16:27:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-03-04 16:27:01,605 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-03-04 16:27:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:01,605 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-03-04 16:27:01,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-03-04 16:27:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-03-04 16:27:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-03-04 16:27:01,606 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:01,606 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-03-04 16:27:01,606 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-03-04 16:27:01,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:01,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:01,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:01,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:03,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:03,189 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:27:03,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:03,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 182 conjunts are in the unsatisfiable core [2019-03-04 16:27:03,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:03,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:27:03,371 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,382 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:03,382 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:05,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:05,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2019-03-04 16:27:05,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-03-04 16:27:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-03-04 16:27:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:27:05,364 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-03-04 16:27:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:08,644 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-03-04 16:27:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:27:08,644 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-03-04 16:27:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:08,645 INFO L225 Difference]: With dead ends: 290 [2019-03-04 16:27:08,645 INFO L226 Difference]: Without dead ends: 289 [2019-03-04 16:27:08,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9976, Invalid=19780, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 16:27:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-03-04 16:27:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-03-04 16:27:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-03-04 16:27:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-03-04 16:27:08,703 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-03-04 16:27:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:08,703 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-03-04 16:27:08,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-03-04 16:27:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-03-04 16:27:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-03-04 16:27:08,704 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:08,704 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-03-04 16:27:08,704 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-03-04 16:27:08,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:08,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:08,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:10,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:10,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 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:27:10,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:10,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:10,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:10,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 187 conjunts are in the unsatisfiable core [2019-03-04 16:27:10,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:10,597 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:10,597 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,605 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:10,605 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:12,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:12,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2019-03-04 16:27:12,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-03-04 16:27:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-03-04 16:27:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:27:12,736 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-03-04 16:27:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:15,919 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-03-04 16:27:15,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-03-04 16:27:15,919 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-03-04 16:27:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:15,921 INFO L225 Difference]: With dead ends: 295 [2019-03-04 16:27:15,921 INFO L226 Difference]: Without dead ends: 294 [2019-03-04 16:27:15,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9855 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10325, Invalid=20475, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:27:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-03-04 16:27:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-03-04 16:27:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-03-04 16:27:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-03-04 16:27:15,983 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-03-04 16:27:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:15,984 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-03-04 16:27:15,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-03-04 16:27:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-03-04 16:27:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-03-04 16:27:15,985 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:15,985 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-03-04 16:27:15,985 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-03-04 16:27:15,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:15,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:15,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:15,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:15,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:17,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:17,929 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:27:17,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:18,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-03-04 16:27:18,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:18,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 190 conjunts are in the unsatisfiable core [2019-03-04 16:27:18,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:18,369 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:18,369 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,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:27:18,379 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:20,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:20,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2019-03-04 16:27:20,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-03-04 16:27:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-03-04 16:27:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:27:20,492 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-03-04 16:27:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:23,895 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-03-04 16:27:23,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:27:23,895 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-03-04 16:27:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:23,897 INFO L225 Difference]: With dead ends: 300 [2019-03-04 16:27:23,897 INFO L226 Difference]: Without dead ends: 299 [2019-03-04 16:27:23,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 16:27:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-03-04 16:27:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-03-04 16:27:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-03-04 16:27:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-03-04 16:27:24,001 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-03-04 16:27:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:24,001 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-03-04 16:27:24,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-03-04 16:27:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-03-04 16:27:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-03-04 16:27:24,002 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:24,002 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-03-04 16:27:24,003 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:24,003 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-03-04 16:27:24,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:24,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:24,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:25,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:25,780 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:27:25,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:27:25,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:27:25,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:25,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 193 conjunts are in the unsatisfiable core [2019-03-04 16:27:25,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:25,989 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,989 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,997 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,997 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:28,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:28,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2019-03-04 16:27:28,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-03-04 16:27:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-03-04 16:27:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:27:28,247 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-03-04 16:27:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:31,606 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-03-04 16:27:31,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:27:31,606 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-03-04 16:27:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:31,607 INFO L225 Difference]: With dead ends: 305 [2019-03-04 16:27:31,607 INFO L226 Difference]: Without dead ends: 304 [2019-03-04 16:27:31,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:27:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-03-04 16:27:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-03-04 16:27:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-03-04 16:27:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-03-04 16:27:31,671 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-03-04 16:27:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:31,672 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-03-04 16:27:31,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-03-04 16:27:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-03-04 16:27:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-03-04 16:27:31,673 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:31,673 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-03-04 16:27:31,673 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:31,673 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-03-04 16:27:31,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:31,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:31,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:31,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:31,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:33,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:33,561 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:27:33,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:27:33,949 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-03-04 16:27:33,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:33,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 196 conjunts are in the unsatisfiable core [2019-03-04 16:27:33,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:33,964 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:33,965 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,975 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:33,975 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:36,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:36,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2019-03-04 16:27:36,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-03-04 16:27:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-03-04 16:27:36,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2019-03-04 16:27:36,164 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-03-04 16:27:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:39,830 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-03-04 16:27:39,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:27:39,831 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-03-04 16:27:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:39,832 INFO L225 Difference]: With dead ends: 310 [2019-03-04 16:27:39,832 INFO L226 Difference]: Without dead ends: 309 [2019-03-04 16:27:39,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11408, Invalid=22632, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 16:27:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-03-04 16:27:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-03-04 16:27:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-03-04 16:27:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-03-04 16:27:39,896 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-03-04 16:27:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:39,897 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-03-04 16:27:39,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-03-04 16:27:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-03-04 16:27:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-03-04 16:27:39,898 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:39,898 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-03-04 16:27:39,898 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:39,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-03-04 16:27:39,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:39,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:39,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:39,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:39,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:41,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:41,711 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:27:41,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:27:42,181 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-03-04 16:27:42,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:42,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 201 conjunts are in the unsatisfiable core [2019-03-04 16:27:42,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:42,195 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:42,195 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:42,203 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:42,203 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:44,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:44,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2019-03-04 16:27:44,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-03-04 16:27:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-03-04 16:27:44,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5800, Invalid=9950, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:27:44,602 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-03-04 16:27:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:48,176 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-03-04 16:27:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:27:48,176 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-03-04 16:27:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:48,177 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:27:48,177 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:27:48,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11279 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11781, Invalid=23375, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:27:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:27:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-03-04 16:27:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-03-04 16:27:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-03-04 16:27:48,254 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-03-04 16:27:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:48,254 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-03-04 16:27:48,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-03-04 16:27:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-03-04 16:27:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-03-04 16:27:48,255 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:48,255 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-03-04 16:27:48,256 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:48,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-03-04 16:27:48,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:48,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:48,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:50,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:50,200 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:27:50,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:50,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 200 conjunts are in the unsatisfiable core [2019-03-04 16:27:50,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:50,412 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:50,412 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:50,421 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:50,421 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:52,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:52,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2019-03-04 16:27:52,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:27:52,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:27:52,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5988, Invalid=10268, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:27:52,837 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-03-04 16:27:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:56,615 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-03-04 16:27:56,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-03-04 16:27:56,616 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-03-04 16:27:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:56,617 INFO L225 Difference]: With dead ends: 320 [2019-03-04 16:27:56,617 INFO L226 Difference]: Without dead ends: 319 [2019-03-04 16:27:56,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11650 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12160, Invalid=24130, Unknown=0, NotChecked=0, Total=36290 [2019-03-04 16:27:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-03-04 16:27:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-03-04 16:27:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-03-04 16:27:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-03-04 16:27:56,686 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-03-04 16:27:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:56,686 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-03-04 16:27:56,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:27:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-03-04 16:27:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-03-04 16:27:56,688 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:56,688 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-03-04 16:27:56,688 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:27:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-03-04 16:27:56,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:56,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:58,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:58,609 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:27:58,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:58,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:58,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:58,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 205 conjunts are in the unsatisfiable core [2019-03-04 16:27:58,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:58,828 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:58,828 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:58,840 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:58,840 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:01,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:01,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2019-03-04 16:28:01,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-03-04 16:28:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-03-04 16:28:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6179, Invalid=10591, Unknown=0, NotChecked=0, Total=16770 [2019-03-04 16:28:01,569 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-03-04 16:28:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:05,306 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-03-04 16:28:05,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:28:05,307 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-03-04 16:28:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:05,308 INFO L225 Difference]: With dead ends: 325 [2019-03-04 16:28:05,308 INFO L226 Difference]: Without dead ends: 324 [2019-03-04 16:28:05,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12027 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12545, Invalid=24897, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:28:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-03-04 16:28:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-03-04 16:28:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-03-04 16:28:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-03-04 16:28:05,382 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-03-04 16:28:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:05,383 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-03-04 16:28:05,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-03-04 16:28:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-03-04 16:28:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-03-04 16:28:05,384 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:05,384 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-03-04 16:28:05,384 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:28:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-03-04 16:28:05,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:05,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:05,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:07,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:07,448 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:28:07,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:28:07,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-03-04 16:28:07,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:07,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 208 conjunts are in the unsatisfiable core [2019-03-04 16:28:07,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:07,941 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,942 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:07,952 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,952 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:10,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:10,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2019-03-04 16:28:10,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-03-04 16:28:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-03-04 16:28:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6373, Invalid=10919, Unknown=0, NotChecked=0, Total=17292 [2019-03-04 16:28:10,467 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-03-04 16:28:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:14,358 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-03-04 16:28:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:28:14,358 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-03-04 16:28:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:14,359 INFO L225 Difference]: With dead ends: 330 [2019-03-04 16:28:14,359 INFO L226 Difference]: Without dead ends: 329 [2019-03-04 16:28:14,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12410 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12936, Invalid=25676, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 16:28:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-03-04 16:28:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-03-04 16:28:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-03-04 16:28:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-03-04 16:28:14,434 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-03-04 16:28:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:14,434 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-03-04 16:28:14,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-03-04 16:28:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-03-04 16:28:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-03-04 16:28:14,435 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:14,436 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-03-04 16:28:14,436 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:28:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-03-04 16:28:14,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:14,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:14,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:16,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:16,497 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:28:16,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:28:16,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:28:16,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:16,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 211 conjunts are in the unsatisfiable core [2019-03-04 16:28:16,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:16,730 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:16,731 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:16,743 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:16,743 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:19,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:19,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2019-03-04 16:28:19,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-03-04 16:28:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-03-04 16:28:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6570, Invalid=11252, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:28:19,352 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-03-04 16:28:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:23,486 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-03-04 16:28:23,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-03-04 16:28:23,486 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-03-04 16:28:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:23,488 INFO L225 Difference]: With dead ends: 335 [2019-03-04 16:28:23,488 INFO L226 Difference]: Without dead ends: 334 [2019-03-04 16:28:23,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12799 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=13333, Invalid=26467, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:28:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-03-04 16:28:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-03-04 16:28:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-03-04 16:28:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-03-04 16:28:23,565 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-03-04 16:28:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:23,566 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-03-04 16:28:23,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-03-04 16:28:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-03-04 16:28:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-03-04 16:28:23,567 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:23,567 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-03-04 16:28:23,567 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:28:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-03-04 16:28:23,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:23,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:23,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:25,774 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:28:25,782 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:28:26,185 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-03-04 16:28:26,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:26,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 214 conjunts are in the unsatisfiable core [2019-03-04 16:28:26,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:26,200 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:26,200 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:26,210 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:26,210 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:28,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2019-03-04 16:28:28,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-03-04 16:28:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-03-04 16:28:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6770, Invalid=11590, Unknown=0, NotChecked=0, Total=18360 [2019-03-04 16:28:28,855 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-03-04 16:28:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:33,102 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-03-04 16:28:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 16:28:33,103 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-03-04 16:28:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:33,104 INFO L225 Difference]: With dead ends: 340 [2019-03-04 16:28:33,104 INFO L226 Difference]: Without dead ends: 339 [2019-03-04 16:28:33,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13194 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13736, Invalid=27270, Unknown=0, NotChecked=0, Total=41006 [2019-03-04 16:28:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-03-04 16:28:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-03-04 16:28:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-03-04 16:28:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-03-04 16:28:33,184 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-03-04 16:28:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:33,184 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-03-04 16:28:33,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-03-04 16:28:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-03-04 16:28:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-03-04 16:28:33,186 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:33,186 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-03-04 16:28:33,186 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:28:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:33,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-03-04 16:28:33,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:33,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:33,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:35,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:35,396 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:28:35,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:28:35,942 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-03-04 16:28:35,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:35,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 219 conjunts are in the unsatisfiable core [2019-03-04 16:28:35,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:35,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:28:35,958 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:35,967 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:35,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:38,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:38,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2019-03-04 16:28:38,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-03-04 16:28:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-03-04 16:28:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6973, Invalid=11933, Unknown=0, NotChecked=0, Total=18906 [2019-03-04 16:28:38,687 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-03-04 16:28:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:43,008 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-03-04 16:28:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-03-04 16:28:43,008 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-03-04 16:28:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:43,009 INFO L225 Difference]: With dead ends: 345 [2019-03-04 16:28:43,009 INFO L226 Difference]: Without dead ends: 344 [2019-03-04 16:28:43,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13595 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=14145, Invalid=28085, Unknown=0, NotChecked=0, Total=42230 [2019-03-04 16:28:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-03-04 16:28:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-03-04 16:28:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-03-04 16:28:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-03-04 16:28:43,090 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-03-04 16:28:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:43,090 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-03-04 16:28:43,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-03-04 16:28:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-03-04 16:28:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-03-04 16:28:43,091 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:43,091 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-03-04 16:28:43,092 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:28:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-03-04 16:28:43,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:43,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:43,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:43,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:45,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:45,374 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:28:45,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:45,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 218 conjunts are in the unsatisfiable core [2019-03-04 16:28:45,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:45,596 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,596 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:45,606 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,606 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:48,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:48,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2019-03-04 16:28:48,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-03-04 16:28:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-03-04 16:28:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7179, Invalid=12281, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:28:48,378 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-03-04 16:28:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:52,699 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-03-04 16:28:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:28:52,699 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-03-04 16:28:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:52,700 INFO L225 Difference]: With dead ends: 350 [2019-03-04 16:28:52,700 INFO L226 Difference]: Without dead ends: 349 [2019-03-04 16:28:52,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14002 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=14560, Invalid=28912, Unknown=0, NotChecked=0, Total=43472 [2019-03-04 16:28:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-03-04 16:28:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-03-04 16:28:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-03-04 16:28:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-03-04 16:28:52,798 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-03-04 16:28:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:52,799 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-03-04 16:28:52,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-03-04 16:28:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-03-04 16:28:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-03-04 16:28:52,800 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:52,800 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-03-04 16:28:52,800 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:28:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-03-04 16:28:52,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:52,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:55,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:55,139 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:28:55,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:28:55,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:28:55,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:55,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 223 conjunts are in the unsatisfiable core [2019-03-04 16:28:55,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:55,374 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:55,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:55,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:28:55,383 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:58,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:58,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2019-03-04 16:28:58,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-03-04 16:28:58,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-03-04 16:28:58,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7388, Invalid=12634, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 16:28:58,253 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-03-04 16:29:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:02,759 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-03-04 16:29:02,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-03-04 16:29:02,759 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-03-04 16:29:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:02,760 INFO L225 Difference]: With dead ends: 355 [2019-03-04 16:29:02,760 INFO L226 Difference]: Without dead ends: 354 [2019-03-04 16:29:02,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14415 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14981, Invalid=29751, Unknown=0, NotChecked=0, Total=44732 [2019-03-04 16:29:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-03-04 16:29:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-03-04 16:29:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-03-04 16:29:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-03-04 16:29:02,846 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-03-04 16:29:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:02,846 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-03-04 16:29:02,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-03-04 16:29:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-03-04 16:29:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-03-04 16:29:02,847 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:02,848 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-03-04 16:29:02,848 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:29:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-03-04 16:29:02,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:02,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:02,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:02,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:02,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:05,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:05,216 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:29:05,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:29:05,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-03-04 16:29:05,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:05,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 226 conjunts are in the unsatisfiable core [2019-03-04 16:29:05,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:05,803 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:05,803 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,811 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:05,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:08,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:08,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2019-03-04 16:29:08,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-03-04 16:29:08,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-03-04 16:29:08,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7600, Invalid=12992, Unknown=0, NotChecked=0, Total=20592 [2019-03-04 16:29:08,764 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-03-04 16:29:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:13,360 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-03-04 16:29:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-03-04 16:29:13,360 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-03-04 16:29:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:13,361 INFO L225 Difference]: With dead ends: 360 [2019-03-04 16:29:13,361 INFO L226 Difference]: Without dead ends: 359 [2019-03-04 16:29:13,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14834 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=15408, Invalid=30602, Unknown=0, NotChecked=0, Total=46010 [2019-03-04 16:29:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-03-04 16:29:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-03-04 16:29:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-03-04 16:29:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-03-04 16:29:13,447 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-03-04 16:29:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:13,448 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-03-04 16:29:13,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-03-04 16:29:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-03-04 16:29:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-03-04 16:29:13,449 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:13,449 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-03-04 16:29:13,449 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:29:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-03-04 16:29:13,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:13,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:13,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:13,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:13,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:15,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:15,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 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:29:15,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:29:16,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:29:16,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:16,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 229 conjunts are in the unsatisfiable core [2019-03-04 16:29:16,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:16,204 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:16,204 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,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:29:16,215 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:19,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:19,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2019-03-04 16:29:19,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-03-04 16:29:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-03-04 16:29:19,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7815, Invalid=13355, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:29:19,225 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-03-04 16:29:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:23,933 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-03-04 16:29:23,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:29:23,933 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-03-04 16:29:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:23,935 INFO L225 Difference]: With dead ends: 365 [2019-03-04 16:29:23,935 INFO L226 Difference]: Without dead ends: 364 [2019-03-04 16:29:23,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15259 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=15841, Invalid=31465, Unknown=0, NotChecked=0, Total=47306 [2019-03-04 16:29:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-03-04 16:29:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-03-04 16:29:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-03-04 16:29:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-03-04 16:29:24,023 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-03-04 16:29:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:24,024 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-03-04 16:29:24,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-03-04 16:29:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-03-04 16:29:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-03-04 16:29:24,025 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:24,025 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-03-04 16:29:24,025 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:29:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-03-04 16:29:24,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:24,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:24,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:26,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:26,573 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:29:26,581 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:29:27,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-03-04 16:29:27,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:27,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 232 conjunts are in the unsatisfiable core [2019-03-04 16:29:27,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:27,099 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,099 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,107 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,107 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:30,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:30,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2019-03-04 16:29:30,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-03-04 16:29:30,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-03-04 16:29:30,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8033, Invalid=13723, Unknown=0, NotChecked=0, Total=21756 [2019-03-04 16:29:30,188 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-03-04 16:29:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:34,937 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-03-04 16:29:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:29:34,937 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-03-04 16:29:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:34,939 INFO L225 Difference]: With dead ends: 370 [2019-03-04 16:29:34,939 INFO L226 Difference]: Without dead ends: 369 [2019-03-04 16:29:34,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15690 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=16280, Invalid=32340, Unknown=0, NotChecked=0, Total=48620 [2019-03-04 16:29:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-03-04 16:29:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-03-04 16:29:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-03-04 16:29:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-03-04 16:29:35,039 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-03-04 16:29:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:35,039 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-03-04 16:29:35,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-03-04 16:29:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-03-04 16:29:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-03-04 16:29:35,041 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:35,041 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-03-04 16:29:35,041 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:29:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-03-04 16:29:35,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:35,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:35,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:35,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:35,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:37,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:37,637 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:29:37,645 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:29:38,280 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-03-04 16:29:38,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:38,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 237 conjunts are in the unsatisfiable core [2019-03-04 16:29:38,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:38,296 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:38,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:38,304 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:38,304 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:41,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:41,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2019-03-04 16:29:41,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-03-04 16:29:41,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-03-04 16:29:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8254, Invalid=14096, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:29:41,588 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-03-04 16:29:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:46,618 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-03-04 16:29:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-03-04 16:29:46,619 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-03-04 16:29:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:46,620 INFO L225 Difference]: With dead ends: 375 [2019-03-04 16:29:46,620 INFO L226 Difference]: Without dead ends: 374 [2019-03-04 16:29:46,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16127 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=16725, Invalid=33227, Unknown=0, NotChecked=0, Total=49952 [2019-03-04 16:29:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-03-04 16:29:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-03-04 16:29:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-03-04 16:29:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-03-04 16:29:46,717 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-03-04 16:29:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:46,717 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-03-04 16:29:46,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-03-04 16:29:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-03-04 16:29:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-03-04 16:29:46,718 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:46,718 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-03-04 16:29:46,719 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:29:46,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-03-04 16:29:46,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:46,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:46,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:46,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:46,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:49,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:49,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 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:29:49,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:49,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 236 conjunts are in the unsatisfiable core [2019-03-04 16:29:49,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:49,555 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:49,555 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:49,563 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:49,563 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:52,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:52,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2019-03-04 16:29:52,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-03-04 16:29:52,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-03-04 16:29:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8478, Invalid=14474, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:29:52,908 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-03-04 16:29:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:58,134 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-03-04 16:29:58,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-03-04 16:29:58,134 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-03-04 16:29:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:58,136 INFO L225 Difference]: With dead ends: 380 [2019-03-04 16:29:58,136 INFO L226 Difference]: Without dead ends: 379 [2019-03-04 16:29:58,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16570 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17176, Invalid=34126, Unknown=0, NotChecked=0, Total=51302 [2019-03-04 16:29:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-03-04 16:29:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-03-04 16:29:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-03-04 16:29:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-03-04 16:29:58,236 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-03-04 16:29:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:58,237 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-03-04 16:29:58,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-03-04 16:29:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-03-04 16:29:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-03-04 16:29:58,238 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:58,239 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-03-04 16:29:58,239 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:29:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-03-04 16:29:58,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:58,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:58,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:01,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:01,233 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:30:01,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:30:01,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:30:01,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:01,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 241 conjunts are in the unsatisfiable core [2019-03-04 16:30:01,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:01,488 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:01,488 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:01,496 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:01,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:04,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:04,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2019-03-04 16:30:04,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-03-04 16:30:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-03-04 16:30:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8705, Invalid=14857, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:30:04,927 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-03-04 16:30:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:10,199 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-03-04 16:30:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-03-04 16:30:10,199 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-03-04 16:30:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:10,200 INFO L225 Difference]: With dead ends: 385 [2019-03-04 16:30:10,200 INFO L226 Difference]: Without dead ends: 384 [2019-03-04 16:30:10,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17019 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=17633, Invalid=35037, Unknown=0, NotChecked=0, Total=52670 [2019-03-04 16:30:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-03-04 16:30:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-03-04 16:30:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-03-04 16:30:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-03-04 16:30:10,359 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-03-04 16:30:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:10,359 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-03-04 16:30:10,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-03-04 16:30:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-03-04 16:30:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-03-04 16:30:10,360 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:10,361 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-03-04 16:30:10,361 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:30:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-03-04 16:30:10,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:10,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:10,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:13,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:13,126 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:30:13,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:30:13,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-03-04 16:30:13,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:13,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 244 conjunts are in the unsatisfiable core [2019-03-04 16:30:13,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:13,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:30:13,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:13,809 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:13,809 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:17,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:17,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 154 [2019-03-04 16:30:17,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-03-04 16:30:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-03-04 16:30:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8935, Invalid=15245, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:30:17,277 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-03-04 16:30:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:22,577 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-03-04 16:30:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 16:30:22,577 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-03-04 16:30:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:22,579 INFO L225 Difference]: With dead ends: 390 [2019-03-04 16:30:22,579 INFO L226 Difference]: Without dead ends: 389 [2019-03-04 16:30:22,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17474 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=18096, Invalid=35960, Unknown=0, NotChecked=0, Total=54056 [2019-03-04 16:30:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-03-04 16:30:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-03-04 16:30:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-03-04 16:30:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-03-04 16:30:22,686 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-03-04 16:30:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:22,686 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-03-04 16:30:22,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-03-04 16:30:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-03-04 16:30:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-03-04 16:30:22,687 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:22,687 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-03-04 16:30:22,688 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:30:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-03-04 16:30:22,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:22,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:22,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:25,613 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:30:25,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:30:25,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:30:25,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:25,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 247 conjunts are in the unsatisfiable core [2019-03-04 16:30:25,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:25,884 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,884 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:25,893 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,893 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:29,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:29,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 156 [2019-03-04 16:30:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-03-04 16:30:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-03-04 16:30:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9168, Invalid=15638, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:30:29,436 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-03-04 16:30:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:34,697 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-03-04 16:30:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-03-04 16:30:34,698 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-03-04 16:30:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:34,699 INFO L225 Difference]: With dead ends: 395 [2019-03-04 16:30:34,699 INFO L226 Difference]: Without dead ends: 394 [2019-03-04 16:30:34,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17935 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=18565, Invalid=36895, Unknown=0, NotChecked=0, Total=55460 [2019-03-04 16:30:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-03-04 16:30:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-03-04 16:30:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-03-04 16:30:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-03-04 16:30:34,809 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-03-04 16:30:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:34,809 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-03-04 16:30:34,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-03-04 16:30:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-03-04 16:30:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-03-04 16:30:34,810 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:34,811 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-03-04 16:30:34,811 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:30:34,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:34,811 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-03-04 16:30:34,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:34,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:34,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:34,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:34,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:37,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:37,783 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:30:37,792 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:30:38,366 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-03-04 16:30:38,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:38,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 250 conjunts are in the unsatisfiable core [2019-03-04 16:30:38,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:38,385 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:38,386 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,396 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:38,396 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:41,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:41,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 158 [2019-03-04 16:30:41,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-03-04 16:30:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-03-04 16:30:41,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9404, Invalid=16036, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:30:41,974 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-03-04 16:30:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:47,495 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-03-04 16:30:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-03-04 16:30:47,496 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-03-04 16:30:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:47,497 INFO L225 Difference]: With dead ends: 400 [2019-03-04 16:30:47,497 INFO L226 Difference]: Without dead ends: 399 [2019-03-04 16:30:47,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18402 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=19040, Invalid=37842, Unknown=0, NotChecked=0, Total=56882 [2019-03-04 16:30:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-03-04 16:30:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-03-04 16:30:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-03-04 16:30:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-03-04 16:30:47,611 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-03-04 16:30:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:47,611 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-03-04 16:30:47,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-03-04 16:30:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-03-04 16:30:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-03-04 16:30:47,613 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:47,613 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-03-04 16:30:47,613 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:30:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-03-04 16:30:47,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:47,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:47,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:50,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:50,640 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:30:50,647 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:30:51,327 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-03-04 16:30:51,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:51,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 255 conjunts are in the unsatisfiable core [2019-03-04 16:30:51,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:51,347 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:51,347 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:51,355 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:51,355 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:55,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:55,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 160 [2019-03-04 16:30:55,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-03-04 16:30:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-03-04 16:30:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9643, Invalid=16439, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:30:55,141 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-03-04 16:31:00,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:00,657 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-03-04 16:31:00,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 16:31:00,657 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-03-04 16:31:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:00,658 INFO L225 Difference]: With dead ends: 405 [2019-03-04 16:31:00,658 INFO L226 Difference]: Without dead ends: 404 [2019-03-04 16:31:00,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18875 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19521, Invalid=38801, Unknown=0, NotChecked=0, Total=58322 [2019-03-04 16:31:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-03-04 16:31:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-03-04 16:31:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-03-04 16:31:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-03-04 16:31:00,774 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-03-04 16:31:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:00,775 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-03-04 16:31:00,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-03-04 16:31:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-03-04 16:31:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-03-04 16:31:00,776 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:00,776 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-03-04 16:31:00,776 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:31:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-03-04 16:31:00,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:00,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:00,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:03,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:03,775 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:31:03,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:04,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 254 conjunts are in the unsatisfiable core [2019-03-04 16:31:04,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:04,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:31:04,060 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:04,070 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:31:04,070 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:07,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:07,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 162 [2019-03-04 16:31:07,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-03-04 16:31:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-03-04 16:31:07,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9885, Invalid=16847, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:31:07,828 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-03-04 16:31:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:13,571 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-03-04 16:31:13,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 16:31:13,572 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-03-04 16:31:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:13,573 INFO L225 Difference]: With dead ends: 410 [2019-03-04 16:31:13,573 INFO L226 Difference]: Without dead ends: 409 [2019-03-04 16:31:13,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19354 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=20008, Invalid=39772, Unknown=0, NotChecked=0, Total=59780 [2019-03-04 16:31:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-03-04 16:31:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-03-04 16:31:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-03-04 16:31:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-03-04 16:31:13,692 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-03-04 16:31:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:13,692 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-03-04 16:31:13,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-03-04 16:31:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-03-04 16:31:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-03-04 16:31:13,693 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:13,694 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-03-04 16:31:13,694 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:31:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-03-04 16:31:13,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:13,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:16,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:16,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 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:31:16,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:31:17,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:31:17,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:17,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 1714 conjuncts, 259 conjunts are in the unsatisfiable core [2019-03-04 16:31:17,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:17,092 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:31:17,092 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:17,100 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:31:17,100 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:20,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 164 [2019-03-04 16:31:20,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-03-04 16:31:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-03-04 16:31:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10130, Invalid=17260, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:31:20,952 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-03-04 16:31:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:26,905 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-03-04 16:31:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-03-04 16:31:26,906 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-03-04 16:31:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:26,907 INFO L225 Difference]: With dead ends: 415 [2019-03-04 16:31:26,907 INFO L226 Difference]: Without dead ends: 414 [2019-03-04 16:31:26,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19839 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=20501, Invalid=40755, Unknown=0, NotChecked=0, Total=61256 [2019-03-04 16:31:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-03-04 16:31:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-03-04 16:31:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-03-04 16:31:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-03-04 16:31:27,031 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-03-04 16:31:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:27,031 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-03-04 16:31:27,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-03-04 16:31:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-03-04 16:31:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-03-04 16:31:27,032 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:27,032 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-03-04 16:31:27,033 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:31:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-03-04 16:31:27,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:27,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:27,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:27,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:30,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:30,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 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:31:30,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:31:30,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-03-04 16:31:30,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:30,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 262 conjunts are in the unsatisfiable core [2019-03-04 16:31:30,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:30,982 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:31:30,982 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:30,991 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:31:30,991 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:34,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:34,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 166 [2019-03-04 16:31:34,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-03-04 16:31:34,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-03-04 16:31:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10378, Invalid=17678, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:31:34,944 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-03-04 16:31:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:40,958 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-03-04 16:31:40,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 16:31:40,959 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-03-04 16:31:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:40,960 INFO L225 Difference]: With dead ends: 420 [2019-03-04 16:31:40,960 INFO L226 Difference]: Without dead ends: 419 [2019-03-04 16:31:40,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20330 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=21000, Invalid=41750, Unknown=0, NotChecked=0, Total=62750 [2019-03-04 16:31:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-03-04 16:31:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-03-04 16:31:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-03-04 16:31:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-03-04 16:31:41,087 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-03-04 16:31:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:41,088 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-03-04 16:31:41,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-03-04 16:31:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-03-04 16:31:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-03-04 16:31:41,089 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:41,089 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-03-04 16:31:41,089 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:31:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-03-04 16:31:41,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:41,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:41,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:44,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:44,390 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:31:44,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:31:44,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:31:44,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:44,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 265 conjunts are in the unsatisfiable core [2019-03-04 16:31:44,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:44,680 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:31:44,680 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:44,689 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:31:44,689 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:48,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:48,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 168 [2019-03-04 16:31:48,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-03-04 16:31:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-03-04 16:31:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10629, Invalid=18101, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:31:48,749 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-03-04 16:31:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:54,990 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-03-04 16:31:54,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-03-04 16:31:54,990 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-03-04 16:31:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:54,991 INFO L225 Difference]: With dead ends: 425 [2019-03-04 16:31:54,992 INFO L226 Difference]: Without dead ends: 424 [2019-03-04 16:31:54,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20827 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=21505, Invalid=42757, Unknown=0, NotChecked=0, Total=64262 [2019-03-04 16:31:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-03-04 16:31:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-03-04 16:31:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-03-04 16:31:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-03-04 16:31:55,119 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-03-04 16:31:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:55,120 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-03-04 16:31:55,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-03-04 16:31:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-03-04 16:31:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-03-04 16:31:55,121 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:55,122 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-03-04 16:31:55,122 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:31:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:55,122 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-03-04 16:31:55,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:55,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:55,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:58,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:58,812 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:31:58,820 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:31:59,623 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-03-04 16:31:59,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:59,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 268 conjunts are in the unsatisfiable core [2019-03-04 16:31:59,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:59,643 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:31:59,643 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:59,653 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:31:59,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:32:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:03,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:03,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 170 [2019-03-04 16:32:03,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-03-04 16:32:03,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-03-04 16:32:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10883, Invalid=18529, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:32:03,783 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-03-04 16:32:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:09,904 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-03-04 16:32:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-03-04 16:32:09,904 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-03-04 16:32:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:09,906 INFO L225 Difference]: With dead ends: 430 [2019-03-04 16:32:09,906 INFO L226 Difference]: Without dead ends: 429 [2019-03-04 16:32:09,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21330 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=22016, Invalid=43776, Unknown=0, NotChecked=0, Total=65792 [2019-03-04 16:32:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-03-04 16:32:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-03-04 16:32:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-03-04 16:32:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-03-04 16:32:10,038 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-03-04 16:32:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:10,039 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-03-04 16:32:10,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-03-04 16:32:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-03-04 16:32:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-03-04 16:32:10,041 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:10,041 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-03-04 16:32:10,041 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:32:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-03-04 16:32:10,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:10,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:10,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:32:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:13,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:13,419 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:32:13,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:32:14,208 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-03-04 16:32:14,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:32:14,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 271 conjunts are in the unsatisfiable core [2019-03-04 16:32:14,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:14,226 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:32:14,226 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:14,236 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:32:14,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:32:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:18,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:18,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 172 [2019-03-04 16:32:18,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-03-04 16:32:18,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-03-04 16:32:18,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11140, Invalid=18962, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:32:18,384 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-03-04 16:32:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:24,595 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-03-04 16:32:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-03-04 16:32:24,595 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-03-04 16:32:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:24,597 INFO L225 Difference]: With dead ends: 435 [2019-03-04 16:32:24,597 INFO L226 Difference]: Without dead ends: 434 [2019-03-04 16:32:24,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21839 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=22533, Invalid=44807, Unknown=0, NotChecked=0, Total=67340 [2019-03-04 16:32:24,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-03-04 16:32:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-03-04 16:32:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-03-04 16:32:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-03-04 16:32:24,733 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-03-04 16:32:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:24,733 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-03-04 16:32:24,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-03-04 16:32:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-03-04 16:32:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-03-04 16:32:24,735 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:24,735 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-03-04 16:32:24,735 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:32:24,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-03-04 16:32:24,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:24,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:32:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:28,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:28,221 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:32:28,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:32:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:28,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1819 conjuncts, 272 conjunts are in the unsatisfiable core [2019-03-04 16:32:28,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:28,495 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:32:28,495 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:28,503 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:32:28,503 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:32:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 174 [2019-03-04 16:32:32,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-03-04 16:32:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-03-04 16:32:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11400, Invalid=19400, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:32:32,732 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 176 states. [2019-03-04 16:32:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:39,078 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2019-03-04 16:32:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-03-04 16:32:39,079 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 430 [2019-03-04 16:32:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:39,080 INFO L225 Difference]: With dead ends: 440 [2019-03-04 16:32:39,080 INFO L226 Difference]: Without dead ends: 439 [2019-03-04 16:32:39,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22354 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=23056, Invalid=45850, Unknown=0, NotChecked=0, Total=68906 [2019-03-04 16:32:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-03-04 16:32:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2019-03-04 16:32:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-03-04 16:32:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2019-03-04 16:32:39,217 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2019-03-04 16:32:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:39,217 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2019-03-04 16:32:39,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-03-04 16:32:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2019-03-04 16:32:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-03-04 16:32:39,219 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:39,219 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2019-03-04 16:32:39,219 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:32:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2019-03-04 16:32:39,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:39,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:32:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:43,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:43,343 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:32:43,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:32:43,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:32:43,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:32:43,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1840 conjuncts, 277 conjunts are in the unsatisfiable core [2019-03-04 16:32:43,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:43,618 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:32:43,619 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:43,629 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:32:43,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:32:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:47,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:47,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 176 [2019-03-04 16:32:47,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-03-04 16:32:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-03-04 16:32:47,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11663, Invalid=19843, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:32:47,932 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 178 states. [2019-03-04 16:32:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:54,465 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2019-03-04 16:32:54,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 16:32:54,466 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 435 [2019-03-04 16:32:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:54,467 INFO L225 Difference]: With dead ends: 445 [2019-03-04 16:32:54,467 INFO L226 Difference]: Without dead ends: 444 [2019-03-04 16:32:54,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22875 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=23585, Invalid=46905, Unknown=0, NotChecked=0, Total=70490 [2019-03-04 16:32:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-03-04 16:32:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2019-03-04 16:32:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-03-04 16:32:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2019-03-04 16:32:54,610 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 435 [2019-03-04 16:32:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:54,610 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 441 transitions. [2019-03-04 16:32:54,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-03-04 16:32:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 441 transitions. [2019-03-04 16:32:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-03-04 16:32:54,612 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:54,612 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 88, 87, 87, 1, 1] [2019-03-04 16:32:54,612 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:32:54,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1688536691, now seen corresponding path program 87 times [2019-03-04 16:32:54,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:54,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:54,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:54,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:32:54,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:58,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:58,227 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:32:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:32:59,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-03-04 16:32:59,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:32:59,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 280 conjunts are in the unsatisfiable core [2019-03-04 16:32:59,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:59,091 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:32:59,091 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:59,100 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:32:59,100 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:33:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:03,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:03,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 178 [2019-03-04 16:33:03,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-03-04 16:33:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-03-04 16:33:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11929, Invalid=20291, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:33:03,531 INFO L87 Difference]: Start difference. First operand 441 states and 441 transitions. Second operand 180 states. [2019-03-04 16:33:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:10,084 INFO L93 Difference]: Finished difference Result 450 states and 450 transitions. [2019-03-04 16:33:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-03-04 16:33:10,084 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 440 [2019-03-04 16:33:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:10,086 INFO L225 Difference]: With dead ends: 450 [2019-03-04 16:33:10,086 INFO L226 Difference]: Without dead ends: 449 [2019-03-04 16:33:10,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23402 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=24120, Invalid=47972, Unknown=0, NotChecked=0, Total=72092 [2019-03-04 16:33:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-03-04 16:33:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2019-03-04 16:33:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-03-04 16:33:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 446 transitions. [2019-03-04 16:33:10,234 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 446 transitions. Word has length 440 [2019-03-04 16:33:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:10,234 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 446 transitions. [2019-03-04 16:33:10,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-03-04 16:33:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 446 transitions. [2019-03-04 16:33:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-03-04 16:33:10,236 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:10,236 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 89, 88, 88, 1, 1] [2019-03-04 16:33:10,236 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:33:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:10,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1097953917, now seen corresponding path program 88 times [2019-03-04 16:33:10,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:10,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:10,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:10,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:33:10,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:13,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:13,950 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:33:13,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:33:14,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:33:14,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:33:14,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 283 conjunts are in the unsatisfiable core [2019-03-04 16:33:14,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:14,291 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:33:14,291 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:14,300 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:33:14,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:33:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 180 [2019-03-04 16:33:18,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-03-04 16:33:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-03-04 16:33:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12198, Invalid=20744, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:33:18,818 INFO L87 Difference]: Start difference. First operand 446 states and 446 transitions. Second operand 182 states. [2019-03-04 16:33:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:25,516 INFO L93 Difference]: Finished difference Result 455 states and 455 transitions. [2019-03-04 16:33:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-03-04 16:33:25,516 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 445 [2019-03-04 16:33:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:25,518 INFO L225 Difference]: With dead ends: 455 [2019-03-04 16:33:25,518 INFO L226 Difference]: Without dead ends: 454 [2019-03-04 16:33:25,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23935 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=24661, Invalid=49051, Unknown=0, NotChecked=0, Total=73712 [2019-03-04 16:33:25,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-03-04 16:33:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2019-03-04 16:33:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-03-04 16:33:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2019-03-04 16:33:25,666 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 445 [2019-03-04 16:33:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:25,666 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2019-03-04 16:33:25,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-03-04 16:33:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2019-03-04 16:33:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-03-04 16:33:25,668 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:25,668 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 1, 1] [2019-03-04 16:33:25,668 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:33:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1479610253, now seen corresponding path program 89 times [2019-03-04 16:33:25,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:25,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:25,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:33:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:29,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:29,427 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:33:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:33:30,181 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-03-04 16:33:30,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:33:30,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 286 conjunts are in the unsatisfiable core [2019-03-04 16:33:30,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:30,201 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:33:30,201 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:30,209 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:33:30,209 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:33:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:34,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:34,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 182 [2019-03-04 16:33:34,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-03-04 16:33:34,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-03-04 16:33:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12470, Invalid=21202, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:33:34,851 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 184 states. [2019-03-04 16:33:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:41,686 INFO L93 Difference]: Finished difference Result 460 states and 460 transitions. [2019-03-04 16:33:41,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-03-04 16:33:41,686 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 450 [2019-03-04 16:33:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:41,687 INFO L225 Difference]: With dead ends: 460 [2019-03-04 16:33:41,688 INFO L226 Difference]: Without dead ends: 459 [2019-03-04 16:33:41,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24474 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=25208, Invalid=50142, Unknown=0, NotChecked=0, Total=75350 [2019-03-04 16:33:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-03-04 16:33:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 456. [2019-03-04 16:33:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-03-04 16:33:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 456 transitions. [2019-03-04 16:33:41,842 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 456 transitions. Word has length 450 [2019-03-04 16:33:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:41,842 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 456 transitions. [2019-03-04 16:33:41,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-03-04 16:33:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 456 transitions. [2019-03-04 16:33:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-03-04 16:33:41,844 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:41,844 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 1, 1] [2019-03-04 16:33:41,844 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:33:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:41,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1527178115, now seen corresponding path program 90 times [2019-03-04 16:33:41,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:41,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:41,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:33:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:45,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:45,681 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:33:45,691 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:33:46,542 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-03-04 16:33:46,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:33:46,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1924 conjuncts, 289 conjunts are in the unsatisfiable core [2019-03-04 16:33:46,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:46,560 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:33:46,561 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:46,570 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:33:46,570 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:33:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:51,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:51,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 184 [2019-03-04 16:33:51,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-03-04 16:33:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-03-04 16:33:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12745, Invalid=21665, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:33:51,323 INFO L87 Difference]: Start difference. First operand 456 states and 456 transitions. Second operand 186 states. [2019-03-04 16:33:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:58,208 INFO L93 Difference]: Finished difference Result 465 states and 465 transitions. [2019-03-04 16:33:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 16:33:58,208 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 455 [2019-03-04 16:33:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:58,210 INFO L225 Difference]: With dead ends: 465 [2019-03-04 16:33:58,210 INFO L226 Difference]: Without dead ends: 464 [2019-03-04 16:33:58,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25019 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=25761, Invalid=51245, Unknown=0, NotChecked=0, Total=77006 [2019-03-04 16:33:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-03-04 16:33:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2019-03-04 16:33:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-03-04 16:33:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 461 transitions. [2019-03-04 16:33:58,372 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 461 transitions. Word has length 455 [2019-03-04 16:33:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:58,372 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 461 transitions. [2019-03-04 16:33:58,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-03-04 16:33:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 461 transitions. [2019-03-04 16:33:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-03-04 16:33:58,374 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:58,374 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 92, 91, 91, 1, 1] [2019-03-04 16:33:58,375 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:33:58,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash -686007693, now seen corresponding path program 91 times [2019-03-04 16:33:58,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:58,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:58,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:33:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:02,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:02,305 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:34:02,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:02,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 290 conjunts are in the unsatisfiable core [2019-03-04 16:34:02,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:02,591 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:34:02,591 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:02,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:34:02,601 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:34:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:07,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:07,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 186 [2019-03-04 16:34:07,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-03-04 16:34:07,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-03-04 16:34:07,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13023, Invalid=22133, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:34:07,464 INFO L87 Difference]: Start difference. First operand 461 states and 461 transitions. Second operand 188 states. [2019-03-04 16:34:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:15,245 INFO L93 Difference]: Finished difference Result 470 states and 470 transitions. [2019-03-04 16:34:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-03-04 16:34:15,245 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 460 [2019-03-04 16:34:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:15,247 INFO L225 Difference]: With dead ends: 470 [2019-03-04 16:34:15,247 INFO L226 Difference]: Without dead ends: 469 [2019-03-04 16:34:15,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25570 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=26320, Invalid=52360, Unknown=0, NotChecked=0, Total=78680 [2019-03-04 16:34:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-03-04 16:34:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 466. [2019-03-04 16:34:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-03-04 16:34:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 466 transitions. [2019-03-04 16:34:15,456 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 466 transitions. Word has length 460 [2019-03-04 16:34:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:15,456 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 466 transitions. [2019-03-04 16:34:15,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-03-04 16:34:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 466 transitions. [2019-03-04 16:34:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-03-04 16:34:15,458 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:15,458 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 92, 1, 1] [2019-03-04 16:34:15,458 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:34:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:15,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1786005117, now seen corresponding path program 92 times [2019-03-04 16:34:15,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:15,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:15,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:19,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:19,438 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:34:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:34:19,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:34:19,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:34:19,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 295 conjunts are in the unsatisfiable core [2019-03-04 16:34:19,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:19,728 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:34:19,728 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:19,736 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:34:19,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:34:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:24,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:24,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 188 [2019-03-04 16:34:24,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-03-04 16:34:24,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-03-04 16:34:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13304, Invalid=22606, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:34:24,694 INFO L87 Difference]: Start difference. First operand 466 states and 466 transitions. Second operand 190 states. [2019-03-04 16:34:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:32,092 INFO L93 Difference]: Finished difference Result 475 states and 475 transitions. [2019-03-04 16:34:32,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-03-04 16:34:32,092 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 465 [2019-03-04 16:34:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:32,094 INFO L225 Difference]: With dead ends: 475 [2019-03-04 16:34:32,094 INFO L226 Difference]: Without dead ends: 474 [2019-03-04 16:34:32,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26127 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=26885, Invalid=53487, Unknown=0, NotChecked=0, Total=80372 [2019-03-04 16:34:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-03-04 16:34:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2019-03-04 16:34:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-03-04 16:34:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 471 transitions. [2019-03-04 16:34:32,302 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 471 transitions. Word has length 465 [2019-03-04 16:34:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:32,302 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 471 transitions. [2019-03-04 16:34:32,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-03-04 16:34:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 471 transitions. [2019-03-04 16:34:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-03-04 16:34:32,304 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:32,304 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 94, 93, 93, 1, 1] [2019-03-04 16:34:32,304 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:34:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1137884045, now seen corresponding path program 93 times [2019-03-04 16:34:32,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:32,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:32,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:34:32,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:36,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:36,359 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:34:36,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:34:37,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-03-04 16:34:37,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:34:37,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 1987 conjuncts, 298 conjunts are in the unsatisfiable core [2019-03-04 16:34:37,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:37,299 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:34:37,299 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:37,308 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:34:37,308 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:34:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:42,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:42,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 190 [2019-03-04 16:34:42,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-03-04 16:34:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-03-04 16:34:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13588, Invalid=23084, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 16:34:42,380 INFO L87 Difference]: Start difference. First operand 471 states and 471 transitions. Second operand 192 states. [2019-03-04 16:34:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:49,929 INFO L93 Difference]: Finished difference Result 480 states and 480 transitions. [2019-03-04 16:34:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-03-04 16:34:49,929 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 470 [2019-03-04 16:34:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:49,931 INFO L225 Difference]: With dead ends: 480 [2019-03-04 16:34:49,931 INFO L226 Difference]: Without dead ends: 479 [2019-03-04 16:34:49,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26690 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=27456, Invalid=54626, Unknown=0, NotChecked=0, Total=82082 [2019-03-04 16:34:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-03-04 16:34:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2019-03-04 16:34:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-03-04 16:34:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 476 transitions. [2019-03-04 16:34:50,102 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 476 transitions. Word has length 470 [2019-03-04 16:34:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:50,102 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 476 transitions. [2019-03-04 16:34:50,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-03-04 16:34:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 476 transitions. [2019-03-04 16:34:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-03-04 16:34:50,104 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:50,104 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 1, 1] [2019-03-04 16:34:50,105 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:34:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1468199037, now seen corresponding path program 94 times [2019-03-04 16:34:50,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:50,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:34:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:54,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:54,242 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:34:54,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:34:54,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:34:54,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:34:54,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 301 conjunts are in the unsatisfiable core [2019-03-04 16:34:54,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:54,568 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:34:54,568 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:54,576 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:34:54,576 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:34:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 192 [2019-03-04 16:34:59,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-03-04 16:34:59,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-03-04 16:34:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13875, Invalid=23567, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:34:59,740 INFO L87 Difference]: Start difference. First operand 476 states and 476 transitions. Second operand 194 states. [2019-03-04 16:35:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:35:07,394 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2019-03-04 16:35:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 16:35:07,394 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 475 [2019-03-04 16:35:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:35:07,396 INFO L225 Difference]: With dead ends: 485 [2019-03-04 16:35:07,396 INFO L226 Difference]: Without dead ends: 484 [2019-03-04 16:35:07,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27259 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=28033, Invalid=55777, Unknown=0, NotChecked=0, Total=83810 [2019-03-04 16:35:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-03-04 16:35:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 481. [2019-03-04 16:35:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-03-04 16:35:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 481 transitions. [2019-03-04 16:35:07,570 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 481 transitions. Word has length 475 [2019-03-04 16:35:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:35:07,570 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 481 transitions. [2019-03-04 16:35:07,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-03-04 16:35:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 481 transitions. [2019-03-04 16:35:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-03-04 16:35:07,572 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:35:07,572 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 95, 1, 1] [2019-03-04 16:35:07,573 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:35:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:35:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1734234509, now seen corresponding path program 95 times [2019-03-04 16:35:07,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:35:07,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:35:07,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:07,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:35:07,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:11,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:35:11,866 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:35:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:35:12,621 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-03-04 16:35:12,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:35:12,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 2029 conjuncts, 304 conjunts are in the unsatisfiable core [2019-03-04 16:35:12,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:35:12,639 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:35:12,639 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:12,652 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:35:12,652 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:35:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:17,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:35:17,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 194 [2019-03-04 16:35:17,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-03-04 16:35:17,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-03-04 16:35:17,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14165, Invalid=24055, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:35:17,892 INFO L87 Difference]: Start difference. First operand 481 states and 481 transitions. Second operand 196 states. [2019-03-04 16:35:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:35:25,562 INFO L93 Difference]: Finished difference Result 490 states and 490 transitions. [2019-03-04 16:35:25,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-03-04 16:35:25,562 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 480 [2019-03-04 16:35:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:35:25,565 INFO L225 Difference]: With dead ends: 490 [2019-03-04 16:35:25,565 INFO L226 Difference]: Without dead ends: 489 [2019-03-04 16:35:25,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27834 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=28616, Invalid=56940, Unknown=0, NotChecked=0, Total=85556 [2019-03-04 16:35:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-03-04 16:35:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2019-03-04 16:35:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-03-04 16:35:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 486 transitions. [2019-03-04 16:35:25,744 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 486 transitions. Word has length 480 [2019-03-04 16:35:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:35:25,744 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 486 transitions. [2019-03-04 16:35:25,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-03-04 16:35:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 486 transitions. [2019-03-04 16:35:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-03-04 16:35:25,746 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:35:25,747 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 97, 96, 96, 1, 1] [2019-03-04 16:35:25,747 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:35:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:35:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1446700419, now seen corresponding path program 96 times [2019-03-04 16:35:25,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:35:25,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:35:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:25,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:35:25,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:30,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:35:30,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 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:35:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:35:31,104 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-03-04 16:35:31,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:35:31,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 2050 conjuncts, 309 conjunts are in the unsatisfiable core [2019-03-04 16:35:31,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:35:31,124 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:35:31,124 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:31,137 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:35:31,137 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:35:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:36,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:35:36,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 196 [2019-03-04 16:35:36,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-03-04 16:35:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-03-04 16:35:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14458, Invalid=24548, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:35:36,676 INFO L87 Difference]: Start difference. First operand 486 states and 486 transitions. Second operand 198 states. [2019-03-04 16:35:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:35:44,517 INFO L93 Difference]: Finished difference Result 495 states and 495 transitions. [2019-03-04 16:35:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-03-04 16:35:44,517 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 485 [2019-03-04 16:35:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:35:44,519 INFO L225 Difference]: With dead ends: 495 [2019-03-04 16:35:44,519 INFO L226 Difference]: Without dead ends: 494 [2019-03-04 16:35:44,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28415 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=29205, Invalid=58115, Unknown=0, NotChecked=0, Total=87320 [2019-03-04 16:35:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-03-04 16:35:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 491. [2019-03-04 16:35:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-03-04 16:35:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2019-03-04 16:35:44,709 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 485 [2019-03-04 16:35:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:35:44,709 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2019-03-04 16:35:44,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-03-04 16:35:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2019-03-04 16:35:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-03-04 16:35:44,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:35:44,711 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 98, 97, 97, 1, 1] [2019-03-04 16:35:44,711 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:35:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:35:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash 639211635, now seen corresponding path program 97 times [2019-03-04 16:35:44,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:35:44,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:35:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:44,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:35:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 23668 backedges. 0 proven. 23668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:49,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:35:49,138 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:35:49,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:35:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:49,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 2071 conjuncts, 308 conjunts are in the unsatisfiable core [2019-03-04 16:35:49,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:35:49,446 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:35:49,446 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:49,454 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:35:49,455 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:35:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 23668 backedges. 0 proven. 23668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:54,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:35:54,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 198 [2019-03-04 16:35:54,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-03-04 16:35:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-03-04 16:35:54,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14754, Invalid=25046, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:35:54,802 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 200 states. [2019-03-04 16:36:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:02,821 INFO L93 Difference]: Finished difference Result 500 states and 500 transitions. [2019-03-04 16:36:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-03-04 16:36:02,821 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 490 [2019-03-04 16:36:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:02,823 INFO L225 Difference]: With dead ends: 500 [2019-03-04 16:36:02,823 INFO L226 Difference]: Without dead ends: 499 [2019-03-04 16:36:02,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29002 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=29800, Invalid=59302, Unknown=0, NotChecked=0, Total=89102 [2019-03-04 16:36:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-03-04 16:36:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 496. [2019-03-04 16:36:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-03-04 16:36:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 496 transitions. [2019-03-04 16:36:03,010 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 496 transitions. Word has length 490 [2019-03-04 16:36:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:03,010 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 496 transitions. [2019-03-04 16:36:03,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-03-04 16:36:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 496 transitions. [2019-03-04 16:36:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-03-04 16:36:03,013 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:03,013 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 99, 98, 98, 1, 1] [2019-03-04 16:36:03,013 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:36:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -383435901, now seen corresponding path program 98 times [2019-03-04 16:36:03,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:03,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:03,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:36:03,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24157 backedges. 0 proven. 24157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:07,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:07,655 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:36:07,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:36:07,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:36:07,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:36:07,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 2092 conjuncts, 313 conjunts are in the unsatisfiable core [2019-03-04 16:36:07,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:07,969 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:36:07,969 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:07,977 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:36:07,977 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:36:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24157 backedges. 0 proven. 24157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:13,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:13,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 200 [2019-03-04 16:36:13,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-03-04 16:36:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-03-04 16:36:13,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15053, Invalid=25549, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:36:13,475 INFO L87 Difference]: Start difference. First operand 496 states and 496 transitions. Second operand 202 states. [2019-03-04 16:36:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:21,596 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2019-03-04 16:36:21,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:36:21,596 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 495 [2019-03-04 16:36:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:21,598 INFO L225 Difference]: With dead ends: 505 [2019-03-04 16:36:21,599 INFO L226 Difference]: Without dead ends: 504 [2019-03-04 16:36:21,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29595 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=30401, Invalid=60501, Unknown=0, NotChecked=0, Total=90902 [2019-03-04 16:36:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-03-04 16:36:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2019-03-04 16:36:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-03-04 16:36:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2019-03-04 16:36:21,793 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 495 [2019-03-04 16:36:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:21,793 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 501 transitions. [2019-03-04 16:36:21,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-03-04 16:36:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 501 transitions. [2019-03-04 16:36:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-03-04 16:36:21,795 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:21,795 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 100, 99, 99, 1, 1] [2019-03-04 16:36:21,795 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:36:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1774910861, now seen corresponding path program 99 times [2019-03-04 16:36:21,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:21,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:21,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:21,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:36:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 24651 backedges. 0 proven. 24651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:26,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:26,399 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:36:26,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:36:27,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-03-04 16:36:27,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:36:27,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 316 conjunts are in the unsatisfiable core [2019-03-04 16:36:27,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:27,494 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:36:27,494 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:27,505 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:36:27,505 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:36:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24651 backedges. 0 proven. 24651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:33,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:33,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 202 [2019-03-04 16:36:33,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2019-03-04 16:36:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2019-03-04 16:36:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15355, Invalid=26057, Unknown=0, NotChecked=0, Total=41412 [2019-03-04 16:36:33,104 INFO L87 Difference]: Start difference. First operand 501 states and 501 transitions. Second operand 204 states. [2019-03-04 16:36:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:41,433 INFO L93 Difference]: Finished difference Result 510 states and 510 transitions. [2019-03-04 16:36:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-03-04 16:36:41,433 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 500 [2019-03-04 16:36:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:41,435 INFO L225 Difference]: With dead ends: 510 [2019-03-04 16:36:41,435 INFO L226 Difference]: Without dead ends: 509 [2019-03-04 16:36:41,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30194 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=31008, Invalid=61712, Unknown=0, NotChecked=0, Total=92720 [2019-03-04 16:36:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-03-04 16:36:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 506. [2019-03-04 16:36:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-03-04 16:36:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 506 transitions. [2019-03-04 16:36:41,630 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 506 transitions. Word has length 500 [2019-03-04 16:36:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:41,631 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 506 transitions. [2019-03-04 16:36:41,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2019-03-04 16:36:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 506 transitions. [2019-03-04 16:36:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-03-04 16:36:41,633 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:41,633 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 101, 100, 100, 1, 1] [2019-03-04 16:36:41,634 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-03-04 16:36:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 865866115, now seen corresponding path program 100 times [2019-03-04 16:36:41,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:41,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:41,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:41,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:36:41,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat