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-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:53,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:53,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:53,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:53,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:53,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:53,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:53,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:53,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:53,920 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:53,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:53,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:53,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:53,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:53,937 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:53,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:53,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:53,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:53,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:53,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:53,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:53,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:53,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:53,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:53,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:53,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:53,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:53,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:53,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:53,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:53,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:53,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:53,969 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:53,969 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:53,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:53,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:53,971 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,992 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:53,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:53,993 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:53,996 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:53,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:53,997 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:53,997 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:53,997 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:53,997 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:53,998 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:53,998 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:53,998 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:53,998 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:53,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:54,000 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:54,000 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:54,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:54,000 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:54,001 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:54,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:54,002 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:54,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:54,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:54,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:54,003 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:54,003 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:54,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:54,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:54,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:54,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:54,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:54,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:54,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:54,005 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:54,005 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:54,006 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:54,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:54,006 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:54,006 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:54,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:54,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:54,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:54,075 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:54,076 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:54,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-03-04 16:23:54,077 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-03-04 16:23:54,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:54,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:54,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:54,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:54,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:54,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,171 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:23:54,171 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:23:54,171 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:23:54,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:54,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:54,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:54,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:54,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:54,214 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:54,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:23:54,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:23:54,288 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-03-04 16:23:54,537 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:23:54,538 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-03-04 16:23:54,539 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:54 BoogieIcfgContainer [2019-03-04 16:23:54,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:54,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:54,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:54,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:54,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/2) ... [2019-03-04 16:23:54,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363083c3 and model type PointerIncrement-simplified02.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,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:54" (2/2) ... [2019-03-04 16:23:54,552 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-03-04 16:23:54,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:54,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:54,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:54,679 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:54,680 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:54,680 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:54,681 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:54,681 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:54,681 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:54,681 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:54,681 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:54,681 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-03-04 16:23:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:23:54,708 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:54,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:23:54,712 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-03-04 16:23:54,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:54,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:54,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,989 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,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:54,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:23:54,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:55,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:55,008 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-03-04 16:23:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,064 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-03-04 16:23:55,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:55,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:23:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,080 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:23:55,082 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:23:55,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:23:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-03-04 16:23:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:23:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-03-04 16:23:55,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-03-04 16:23:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,130 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-03-04 16:23:55,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-03-04 16:23:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:23:55,131 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,131 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-03-04 16:23:55,132 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-03-04 16:23:55,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:55,243 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,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:23:55,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:55,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:23:55,348 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,380 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,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:55,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:23:55,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:23:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:23:55,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:55,499 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-03-04 16:23:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,608 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-03-04 16:23:55,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:23:55,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-03-04 16:23:55,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,610 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:23:55,610 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:23:55,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:23:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:23:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:23:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-03-04 16:23:55,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-03-04 16:23:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,615 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-03-04 16:23:55,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:23:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-03-04 16:23:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-03-04 16:23:55,616 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,616 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-03-04 16:23:55,616 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-03-04 16:23:55,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:55,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:55,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:55,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:55,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:55,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:23:55,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:55,864 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,864 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,956 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,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:56,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:23:56,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:23:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:23:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:56,063 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-03-04 16:23:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,151 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-03-04 16:23:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:56,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-03-04 16:23:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,153 INFO L225 Difference]: With dead ends: 19 [2019-03-04 16:23:56,153 INFO L226 Difference]: Without dead ends: 18 [2019-03-04 16:23:56,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-03-04 16:23:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-03-04 16:23:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:23:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-03-04 16:23:56,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-03-04 16:23:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,159 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-03-04 16:23:56,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:23:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-03-04 16:23:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-03-04 16:23:56,160 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,160 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-03-04 16:23:56,161 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-03-04 16:23:56,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:56,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:56,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:56,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:56,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:23:56,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:56,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:23:56,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:56,459 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,459 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,471 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,472 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:56,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:23:56,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:23:56,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:23:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:56,655 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-03-04 16:23:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,708 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-03-04 16:23:56,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:23:56,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-03-04 16:23:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,710 INFO L225 Difference]: With dead ends: 23 [2019-03-04 16:23:56,710 INFO L226 Difference]: Without dead ends: 22 [2019-03-04 16:23:56,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-03-04 16:23:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-03-04 16:23:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:23:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-03-04 16:23:56,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-03-04 16:23:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,716 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-03-04 16:23:56,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:23:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-03-04 16:23:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-03-04 16:23:56,717 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,717 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-03-04 16:23:56,718 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-03-04 16:23:56,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:56,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:56,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:23:56,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:23:56,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:56,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:23:56,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:56,882 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,883 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,896 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,897 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:57,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:23:57,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:23:57,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:23:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:57,341 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-03-04 16:23:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:57,433 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-03-04 16:23:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:57,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-03-04 16:23:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:57,438 INFO L225 Difference]: With dead ends: 27 [2019-03-04 16:23:57,438 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:23:57,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:23:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-03-04 16:23:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:23:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-03-04 16:23:57,445 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-03-04 16:23:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:57,446 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-03-04 16:23:57,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:23:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-03-04 16:23:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-03-04 16:23:57,447 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:57,448 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-03-04 16:23:57,449 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-03-04 16:23:57,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:57,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:57,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:57,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:57,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:57,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:23:57,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-03-04 16:23:57,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:57,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-03-04 16:23:57,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:57,691 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,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,707 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,709 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:57,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:23:57,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:23:57,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:23:57,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:57,963 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-03-04 16:23:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,027 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-03-04 16:23:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:23:58,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-03-04 16:23:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,029 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:23:58,029 INFO L226 Difference]: Without dead ends: 30 [2019-03-04 16:23:58,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-03-04 16:23:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-03-04 16:23:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:23:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-03-04 16:23:58,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-03-04 16:23:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-03-04 16:23:58,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:23:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-03-04 16:23:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-03-04 16:23:58,036 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,036 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-03-04 16:23:58,036 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-03-04 16:23:58,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:58,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:58,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:58,230 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:23:58,284 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-03-04 16:23:58,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:58,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjunts are in the unsatisfiable core [2019-03-04 16:23:58,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:58,293 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,293 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,303 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,304 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:58,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-03-04 16:23:58,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:23:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:23:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:23:58,497 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-03-04 16:23:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,576 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-03-04 16:23:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:23:58,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-03-04 16:23:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,579 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:23:58,579 INFO L226 Difference]: Without dead ends: 34 [2019-03-04 16:23:58,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:23:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-03-04 16:23:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-03-04 16:23:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:23:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-03-04 16:23:58,584 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-03-04 16:23:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,585 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-03-04 16:23:58,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:23:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-03-04 16:23:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-03-04 16:23:58,586 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,586 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-03-04 16:23:58,586 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-03-04 16:23:58,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:58,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:58,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:23:58,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:58,765 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,766 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,776 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,777 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:59,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-03-04 16:23:59,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:23:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:23:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:23:59,016 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-03-04 16:23:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:59,238 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-03-04 16:23:59,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:23:59,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-03-04 16:23:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:59,242 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:23:59,242 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:23:59,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:23:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:23:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-03-04 16:23:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:23:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-03-04 16:23:59,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-03-04 16:23:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:59,254 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-03-04 16:23:59,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:23:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-03-04 16:23:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-03-04 16:23:59,257 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,258 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-03-04 16:23:59,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-03-04 16:23:59,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:59,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:59,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:59,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:59,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:59,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:59,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:23:59,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:59,615 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,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,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:23:59,630 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:23:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:59,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-03-04 16:23:59,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:23:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:23:59,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:59,828 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-03-04 16:23:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:59,950 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-03-04 16:23:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:23:59,950 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-03-04 16:23:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:59,952 INFO L225 Difference]: With dead ends: 43 [2019-03-04 16:23:59,952 INFO L226 Difference]: Without dead ends: 42 [2019-03-04 16:23:59,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-03-04 16:23:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-03-04 16:23:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:23:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-03-04 16:23:59,958 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-03-04 16:23:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:59,959 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-03-04 16:23:59,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:23:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-03-04 16:23:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-03-04 16:23:59,960 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,960 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-03-04 16:23:59,960 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-03-04 16:23:59,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:00,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:00,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-03-04 16:24:00,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:00,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 37 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,426 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,427 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,436 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,437 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:00,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-03-04 16:24:00,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-03-04 16:24:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-03-04 16:24:00,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:24:00,821 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-03-04 16:24:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:00,910 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-03-04 16:24:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:24:00,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-03-04 16:24:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:00,912 INFO L225 Difference]: With dead ends: 47 [2019-03-04 16:24:00,912 INFO L226 Difference]: Without dead ends: 46 [2019-03-04 16:24:00,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:24:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-03-04 16:24:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-03-04 16:24:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:24:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-03-04 16:24:00,919 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-03-04 16:24:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:00,919 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-03-04 16:24:00,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-03-04 16:24:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-03-04 16:24:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-03-04 16:24:00,921 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:00,921 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-03-04 16:24:00,921 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-03-04 16:24:00,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:00,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:01,228 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:01,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:01,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:01,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:01,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:24:01,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:01,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:01,287 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,306 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,307 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:01,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-03-04 16:24:01,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-03-04 16:24:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-03-04 16:24:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:24:01,582 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-03-04 16:24:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,673 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-03-04 16:24:01,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:24:01,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-03-04 16:24:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,675 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:24:01,676 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:24:01,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:24:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:24:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-03-04 16:24:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:24:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-03-04 16:24:01,682 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-03-04 16:24:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,682 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-03-04 16:24:01,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-03-04 16:24:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-03-04 16:24:01,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-03-04 16:24:01,683 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,684 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-03-04 16:24:01,684 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-03-04 16:24:01,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:01,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:01,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:01,982 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-03-04 16:24:01,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:01,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 43 conjunts are in the unsatisfiable core [2019-03-04 16:24:01,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,005 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,005 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,014 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,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-03-04 16:24:02,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:24:02,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:24:02,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:02,356 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-03-04 16:24:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:02,491 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-03-04 16:24:02,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:24:02,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-03-04 16:24:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:02,492 INFO L225 Difference]: With dead ends: 55 [2019-03-04 16:24:02,492 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:24:02,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:24:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-03-04 16:24:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-03-04 16:24:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-03-04 16:24:02,499 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-03-04 16:24:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:02,499 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-03-04 16:24:02,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:24:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-03-04 16:24:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-03-04 16:24:02,500 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:02,500 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-03-04 16:24:02,500 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:02,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-03-04 16:24:02,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:02,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:02,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:02,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:02,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:02,766 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:02,804 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-03-04 16:24:02,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:02,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 46 conjunts are in the unsatisfiable core [2019-03-04 16:24:02,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,846 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,846 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,941 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,941 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:03,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2019-03-04 16:24:03,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-03-04 16:24:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-03-04 16:24:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2019-03-04 16:24:03,620 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-03-04 16:24:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,735 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-03-04 16:24:03,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:24:03,740 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-03-04 16:24:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,741 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:24:03,741 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:24:03,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2019-03-04 16:24:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:24:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-03-04 16:24:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-03-04 16:24:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-03-04 16:24:03,747 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-03-04 16:24:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,748 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-03-04 16:24:03,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-03-04 16:24:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-03-04 16:24:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-03-04 16:24:03,750 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,751 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-03-04 16:24:03,751 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-03-04 16:24:03,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:04,280 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:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:04,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 49 conjunts are in the unsatisfiable core [2019-03-04 16:24:04,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:04,317 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,317 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,328 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,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:04,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2019-03-04 16:24:04,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-03-04 16:24:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-03-04 16:24:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:24:04,641 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-03-04 16:24:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:04,807 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-03-04 16:24:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:24:04,807 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-03-04 16:24:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:04,809 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:24:04,809 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:24:04,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:24:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:24:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-03-04 16:24:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:24:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-03-04 16:24:04,815 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-03-04 16:24:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:04,815 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-03-04 16:24:04,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-03-04 16:24:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-03-04 16:24:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-03-04 16:24:04,817 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:04,817 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-03-04 16:24:04,817 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-03-04 16:24:04,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:04,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:04,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:04,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:05,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:05,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:05,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:05,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:24:05,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:05,219 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,219 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,228 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,229 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:05,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2019-03-04 16:24:05,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:24:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:24:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:24:05,545 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-03-04 16:24:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:05,676 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-03-04 16:24:05,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-03-04 16:24:05,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-03-04 16:24:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:05,677 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:24:05,677 INFO L226 Difference]: Without dead ends: 66 [2019-03-04 16:24:05,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:24:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-03-04 16:24:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-03-04 16:24:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-03-04 16:24:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-03-04 16:24:05,684 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-03-04 16:24:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:05,684 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-03-04 16:24:05,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:24:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-03-04 16:24:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-03-04 16:24:05,686 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:05,686 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-03-04 16:24:05,686 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-03-04 16:24:05,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:05,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:06,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 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:06,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:06,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-03-04 16:24:06,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:06,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:24:06,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:06,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:06,700 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,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:06,706 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:06,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2019-03-04 16:24:06,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-03-04 16:24:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-03-04 16:24:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:24:06,999 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-03-04 16:24:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:07,225 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-03-04 16:24:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:24:07,225 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-03-04 16:24:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:07,226 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:24:07,226 INFO L226 Difference]: Without dead ends: 70 [2019-03-04 16:24:07,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:24:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-03-04 16:24:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-03-04 16:24:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-03-04 16:24:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-03-04 16:24:07,233 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-03-04 16:24:07,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:07,234 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-03-04 16:24:07,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-03-04 16:24:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-03-04 16:24:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-03-04 16:24:07,236 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:07,236 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-03-04 16:24:07,236 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:07,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:07,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-03-04 16:24:07,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:07,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:07,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:07,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:07,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:07,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:07,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:07,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:07,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:07,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:24:07,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:07,795 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,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,813 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,814 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:08,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2019-03-04 16:24:08,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-03-04 16:24:08,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-03-04 16:24:08,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2019-03-04 16:24:08,210 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-03-04 16:24:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:08,333 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-03-04 16:24:08,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:24:08,333 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-03-04 16:24:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:08,334 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:24:08,334 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:24:08,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2019-03-04 16:24:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:24:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-03-04 16:24:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:24:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-03-04 16:24:08,341 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-03-04 16:24:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:08,342 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-03-04 16:24:08,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-03-04 16:24:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-03-04 16:24:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:24:08,343 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:08,343 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-03-04 16:24:08,343 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-03-04 16:24:08,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:08,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:08,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:08,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:08,677 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:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:08,718 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-03-04 16:24:08,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:08,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 61 conjunts are in the unsatisfiable core [2019-03-04 16:24:08,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:08,726 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,726 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,734 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,734 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:09,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2019-03-04 16:24:09,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:24:09,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:24:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:09,077 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-03-04 16:24:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:09,179 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-03-04 16:24:09,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:24:09,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-03-04 16:24:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:09,181 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:24:09,181 INFO L226 Difference]: Without dead ends: 78 [2019-03-04 16:24:09,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-03-04 16:24:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-03-04 16:24:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:24:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-03-04 16:24:09,186 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-03-04 16:24:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:09,186 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-03-04 16:24:09,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:24:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-03-04 16:24:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-03-04 16:24:09,187 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:09,188 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-03-04 16:24:09,188 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-03-04 16:24:09,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:09,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:09,581 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:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:09,635 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-03-04 16:24:09,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:09,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:24:09,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:09,655 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:09,655 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,664 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,664 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2019-03-04 16:24:10,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-03-04 16:24:10,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-03-04 16:24:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2019-03-04 16:24:10,273 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-03-04 16:24:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:10,383 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-03-04 16:24:10,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-03-04 16:24:10,383 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-03-04 16:24:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:10,384 INFO L225 Difference]: With dead ends: 83 [2019-03-04 16:24:10,384 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:24:10,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2019-03-04 16:24:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:24:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-03-04 16:24:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:24:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-03-04 16:24:10,388 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-03-04 16:24:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:10,389 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-03-04 16:24:10,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-03-04 16:24:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-03-04 16:24:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-03-04 16:24:10,389 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:10,389 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-03-04 16:24:10,390 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-03-04 16:24:10,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:10,729 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:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:24:10,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:10,773 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,774 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,782 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,783 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:11,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:11,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2019-03-04 16:24:11,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-03-04 16:24:11,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-03-04 16:24:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2019-03-04 16:24:11,587 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-03-04 16:24:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:11,725 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-03-04 16:24:11,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:24:11,726 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-03-04 16:24:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:11,727 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:24:11,727 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:24:11,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2019-03-04 16:24:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:24:11,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-03-04 16:24:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-03-04 16:24:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-03-04 16:24:11,732 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-03-04 16:24:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:11,733 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-03-04 16:24:11,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-03-04 16:24:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-03-04 16:24:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-03-04 16:24:11,734 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:11,734 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-03-04 16:24:11,734 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-03-04 16:24:11,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:11,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:12,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:12,742 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:12,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:12,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:12,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:12,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:24:12,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:12,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:12,786 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,795 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,795 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:13,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:13,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2019-03-04 16:24:13,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:24:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:24:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:24:13,172 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-03-04 16:24:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:13,334 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-03-04 16:24:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:24:13,334 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-03-04 16:24:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:13,336 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:24:13,336 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:24:13,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:24:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:24:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-03-04 16:24:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-03-04 16:24:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-03-04 16:24:13,342 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-03-04 16:24:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:13,342 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-03-04 16:24:13,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:24:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-03-04 16:24:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-03-04 16:24:13,343 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:13,344 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-03-04 16:24:13,344 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-03-04 16:24:13,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:13,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:14,416 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:14,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:14,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-03-04 16:24:14,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:14,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 73 conjunts are in the unsatisfiable core [2019-03-04 16:24:14,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:14,482 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,483 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,494 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,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:15,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2019-03-04 16:24:15,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-03-04 16:24:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-03-04 16:24:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2019-03-04 16:24:15,354 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-03-04 16:24:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:15,553 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-03-04 16:24:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-03-04 16:24:15,556 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-03-04 16:24:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:15,556 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:24:15,556 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:24:15,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2019-03-04 16:24:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:24:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-03-04 16:24:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:24:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-03-04 16:24:15,560 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-03-04 16:24:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:15,561 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-03-04 16:24:15,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-03-04 16:24:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-03-04 16:24:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-03-04 16:24:15,562 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:15,562 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-03-04 16:24:15,562 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-03-04 16:24:15,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:15,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:15,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:15,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:16,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:16,176 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:16,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:16,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:16,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:16,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:24:16,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:16,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:24:16,226 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,235 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:16,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:16,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2019-03-04 16:24:16,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-03-04 16:24:16,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-03-04 16:24:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2019-03-04 16:24:16,651 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-03-04 16:24:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:16,814 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-03-04 16:24:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-03-04 16:24:16,815 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-03-04 16:24:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:16,816 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:24:16,816 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:24:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2019-03-04 16:24:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:24:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-03-04 16:24:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:24:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-03-04 16:24:16,822 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-03-04 16:24:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:16,822 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-03-04 16:24:16,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-03-04 16:24:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-03-04 16:24:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-03-04 16:24:16,823 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:16,823 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-03-04 16:24:16,823 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-03-04 16:24:16,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:16,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:16,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:17,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:17,351 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:17,364 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:17,419 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-03-04 16:24:17,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:17,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 79 conjunts are in the unsatisfiable core [2019-03-04 16:24:17,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:17,427 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,427 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,436 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,436 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:18,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:18,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2019-03-04 16:24:18,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:24:18,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:24:18,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:18,139 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-03-04 16:24:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:18,383 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-03-04 16:24:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:24:18,383 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-03-04 16:24:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:18,385 INFO L225 Difference]: With dead ends: 103 [2019-03-04 16:24:18,385 INFO L226 Difference]: Without dead ends: 102 [2019-03-04 16:24:18,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-03-04 16:24:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-03-04 16:24:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:24:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-03-04 16:24:18,390 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-03-04 16:24:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,391 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-03-04 16:24:18,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:24:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-03-04 16:24:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-03-04 16:24:18,391 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,392 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-03-04 16:24:18,392 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-03-04 16:24:18,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:18,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:18,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18,911 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:18,979 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-03-04 16:24:18,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:18,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 82 conjunts are in the unsatisfiable core [2019-03-04 16:24:18,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:19,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:19,061 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,072 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,072 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:19,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:19,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2019-03-04 16:24:19,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-03-04 16:24:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-03-04 16:24:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2019-03-04 16:24:19,696 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-03-04 16:24:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:19,884 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-03-04 16:24:19,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:24:19,885 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-03-04 16:24:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:19,885 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:24:19,886 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:24:19,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2019-03-04 16:24:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:24:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-03-04 16:24:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-03-04 16:24:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-03-04 16:24:19,890 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-03-04 16:24:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:19,890 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-03-04 16:24:19,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-03-04 16:24:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-03-04 16:24:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-03-04 16:24:19,891 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:19,891 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-03-04 16:24:19,892 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-03-04 16:24:19,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:19,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:19,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:19,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:20,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:20,443 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:20,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:20,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 85 conjunts are in the unsatisfiable core [2019-03-04 16:24:20,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:20,489 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:20,490 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,500 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:21,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2019-03-04 16:24:21,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-03-04 16:24:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-03-04 16:24:21,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2019-03-04 16:24:21,097 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-03-04 16:24:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:21,287 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-03-04 16:24:21,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:24:21,287 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-03-04 16:24:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:21,289 INFO L225 Difference]: With dead ends: 111 [2019-03-04 16:24:21,289 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:24:21,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2019-03-04 16:24:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:24:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-03-04 16:24:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-03-04 16:24:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-03-04 16:24:21,294 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-03-04 16:24:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:21,295 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-03-04 16:24:21,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-03-04 16:24:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-03-04 16:24:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-03-04 16:24:21,295 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:21,295 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-03-04 16:24:21,296 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-03-04 16:24:21,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:21,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:21,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:21,893 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:21,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:21,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:21,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:21,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 88 conjunts are in the unsatisfiable core [2019-03-04 16:24:21,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:21,953 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,953 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,960 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,960 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:22,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:22,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2019-03-04 16:24:22,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-03-04 16:24:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-03-04 16:24:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:24:22,579 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-03-04 16:24:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:22,798 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-03-04 16:24:22,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-03-04 16:24:22,798 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-03-04 16:24:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:22,799 INFO L225 Difference]: With dead ends: 115 [2019-03-04 16:24:22,799 INFO L226 Difference]: Without dead ends: 114 [2019-03-04 16:24:22,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:24:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-03-04 16:24:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-03-04 16:24:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-03-04 16:24:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-03-04 16:24:22,804 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-03-04 16:24:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:22,804 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-03-04 16:24:22,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-03-04 16:24:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-03-04 16:24:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-03-04 16:24:22,805 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:22,805 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-03-04 16:24:22,805 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:22,806 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-03-04 16:24:22,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:22,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:22,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:23,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 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:23,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:23,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-03-04 16:24:23,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:23,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:24:23,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:23,665 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:23,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,675 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:23,676 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:24,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:24,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2019-03-04 16:24:24,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-03-04 16:24:24,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-03-04 16:24:24,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:24:24,257 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-03-04 16:24:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:24,456 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-03-04 16:24:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:24:24,457 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-03-04 16:24:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:24,458 INFO L225 Difference]: With dead ends: 119 [2019-03-04 16:24:24,458 INFO L226 Difference]: Without dead ends: 118 [2019-03-04 16:24:24,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:24:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-03-04 16:24:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-03-04 16:24:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-03-04 16:24:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-03-04 16:24:24,463 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-03-04 16:24:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:24,463 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-03-04 16:24:24,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-03-04 16:24:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-03-04 16:24:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-03-04 16:24:24,464 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:24,464 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-03-04 16:24:24,464 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-03-04 16:24:24,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:24,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:25,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:25,237 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:25,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:25,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:25,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:25,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 94 conjunts are in the unsatisfiable core [2019-03-04 16:24:25,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:25,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:25,290 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,302 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:25,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:25,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:25,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2019-03-04 16:24:25,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-03-04 16:24:25,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-03-04 16:24:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:24:25,998 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-03-04 16:24:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:26,195 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-03-04 16:24:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:24:26,196 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-03-04 16:24:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:26,197 INFO L225 Difference]: With dead ends: 123 [2019-03-04 16:24:26,197 INFO L226 Difference]: Without dead ends: 122 [2019-03-04 16:24:26,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:24:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-03-04 16:24:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-03-04 16:24:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:24:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-03-04 16:24:26,203 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-03-04 16:24:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:26,203 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-03-04 16:24:26,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-03-04 16:24:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-03-04 16:24:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-03-04 16:24:26,204 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:26,204 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-03-04 16:24:26,205 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:26,205 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-03-04 16:24:26,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:26,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:26,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:26,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26,899 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:26,969 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-03-04 16:24:26,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:26,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 97 conjunts are in the unsatisfiable core [2019-03-04 16:24:26,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:27,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:24:27,004 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,099 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,100 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:27,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:27,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2019-03-04 16:24:27,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-03-04 16:24:27,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-03-04 16:24:27,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:24:27,797 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-03-04 16:24:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:28,127 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-03-04 16:24:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:24:28,128 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-03-04 16:24:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:28,129 INFO L225 Difference]: With dead ends: 127 [2019-03-04 16:24:28,129 INFO L226 Difference]: Without dead ends: 126 [2019-03-04 16:24:28,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:24:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-03-04 16:24:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-03-04 16:24:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-03-04 16:24:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-03-04 16:24:28,133 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-03-04 16:24:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:28,133 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-03-04 16:24:28,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-03-04 16:24:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-03-04 16:24:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-03-04 16:24:28,134 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:28,134 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-03-04 16:24:28,134 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-03-04 16:24:28,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:28,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:28,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:28,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:29,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:29,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:29,202 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-03-04 16:24:29,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:29,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 100 conjunts are in the unsatisfiable core [2019-03-04 16:24:29,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:29,212 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:29,213 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,225 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,225 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:29,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:29,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2019-03-04 16:24:29,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-03-04 16:24:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-03-04 16:24:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2019-03-04 16:24:29,949 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-03-04 16:24:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:30,143 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-03-04 16:24:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-03-04 16:24:30,144 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-03-04 16:24:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:30,145 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:24:30,145 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:24:30,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2019-03-04 16:24:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:24:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-03-04 16:24:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-03-04 16:24:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-03-04 16:24:30,151 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-03-04 16:24:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:30,151 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-03-04 16:24:30,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-03-04 16:24:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-03-04 16:24:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-03-04 16:24:30,152 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:30,152 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-03-04 16:24:30,152 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-03-04 16:24:30,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:30,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:30,962 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:30,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:31,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:24:31,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:31,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:31,018 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,026 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,026 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:31,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:31,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2019-03-04 16:24:31,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-03-04 16:24:31,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-03-04 16:24:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:24:31,953 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-03-04 16:24:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:32,155 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-03-04 16:24:32,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:24:32,155 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-03-04 16:24:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:32,156 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:24:32,157 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:24:32,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:24:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:24:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-03-04 16:24:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:24:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-03-04 16:24:32,163 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-03-04 16:24:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:32,164 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-03-04 16:24:32,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-03-04 16:24:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-03-04 16:24:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:24:32,165 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:32,165 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-03-04 16:24:32,165 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:32,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:32,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-03-04 16:24:32,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:32,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:32,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:33,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:33,811 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:33,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:33,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:33,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:33,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 106 conjunts are in the unsatisfiable core [2019-03-04 16:24:33,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:33,916 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,916 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,924 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,925 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:34,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2019-03-04 16:24:34,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-03-04 16:24:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-03-04 16:24:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:24:34,989 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-03-04 16:24:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:35,208 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-03-04 16:24:35,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:24:35,208 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-03-04 16:24:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:35,210 INFO L225 Difference]: With dead ends: 139 [2019-03-04 16:24:35,210 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:24:35,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:24:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:24:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-03-04 16:24:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:24:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-03-04 16:24:35,216 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-03-04 16:24:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:35,216 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-03-04 16:24:35,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-03-04 16:24:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-03-04 16:24:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-03-04 16:24:35,217 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:35,217 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-03-04 16:24:35,218 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:35,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-03-04 16:24:35,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:35,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:35,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:35,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:36,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:36,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:36,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:36,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-03-04 16:24:36,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:36,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 109 conjunts are in the unsatisfiable core [2019-03-04 16:24:36,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:36,166 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,167 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,266 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,266 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:37,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:37,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2019-03-04 16:24:37,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-03-04 16:24:37,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-03-04 16:24:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:24:37,847 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-03-04 16:24:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:38,200 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-03-04 16:24:38,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:24:38,200 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-03-04 16:24:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:38,201 INFO L225 Difference]: With dead ends: 143 [2019-03-04 16:24:38,201 INFO L226 Difference]: Without dead ends: 142 [2019-03-04 16:24:38,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:24:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-03-04 16:24:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-03-04 16:24:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-03-04 16:24:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-03-04 16:24:38,206 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-03-04 16:24:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:38,206 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-03-04 16:24:38,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-03-04 16:24:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-03-04 16:24:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-03-04 16:24:38,207 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:38,207 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-03-04 16:24:38,207 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:38,207 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-03-04 16:24:38,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:38,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:38,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:38,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:39,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:39,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:39,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:39,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:39,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:39,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 112 conjunts are in the unsatisfiable core [2019-03-04 16:24:39,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:39,130 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,130 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,140 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,140 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:40,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:40,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2019-03-04 16:24:40,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-03-04 16:24:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-03-04 16:24:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2019-03-04 16:24:40,080 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-03-04 16:24:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:40,486 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-03-04 16:24:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:24:40,486 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-03-04 16:24:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:40,487 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:24:40,488 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:24:40,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2019-03-04 16:24:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:24:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-03-04 16:24:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-03-04 16:24:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-03-04 16:24:40,498 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-03-04 16:24:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:40,498 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-03-04 16:24:40,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-03-04 16:24:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-03-04 16:24:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-03-04 16:24:40,499 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:40,499 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-03-04 16:24:40,499 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-03-04 16:24:40,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:40,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:41,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:41,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:41,442 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:41,526 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-03-04 16:24:41,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:41,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:24:41,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:41,536 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:41,537 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,547 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:41,547 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:42,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:42,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2019-03-04 16:24:42,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:24:42,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:24:42,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:24:42,513 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-03-04 16:24:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,996 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-03-04 16:24:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-03-04 16:24:42,997 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-03-04 16:24:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:43,001 INFO L225 Difference]: With dead ends: 151 [2019-03-04 16:24:43,001 INFO L226 Difference]: Without dead ends: 150 [2019-03-04 16:24:43,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:24:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-03-04 16:24:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-03-04 16:24:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-03-04 16:24:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-03-04 16:24:43,006 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-03-04 16:24:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:43,006 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-03-04 16:24:43,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:24:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-03-04 16:24:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-03-04 16:24:43,007 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:43,008 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-03-04 16:24:43,008 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-03-04 16:24:43,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:44,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:44,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:44,743 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-03-04 16:24:44,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:44,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 118 conjunts are in the unsatisfiable core [2019-03-04 16:24:44,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:44,762 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:44,762 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,772 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:45,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2019-03-04 16:24:45,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-03-04 16:24:45,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-03-04 16:24:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2019-03-04 16:24:45,730 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-03-04 16:24:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:46,015 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-03-04 16:24:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:24:46,016 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-03-04 16:24:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:46,017 INFO L225 Difference]: With dead ends: 155 [2019-03-04 16:24:46,018 INFO L226 Difference]: Without dead ends: 154 [2019-03-04 16:24:46,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2019-03-04 16:24:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-03-04 16:24:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-03-04 16:24:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-03-04 16:24:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-03-04 16:24:46,024 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-03-04 16:24:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:46,025 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-03-04 16:24:46,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-03-04 16:24:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-03-04 16:24:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-03-04 16:24:46,026 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:46,026 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-03-04 16:24:46,026 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-03-04 16:24:46,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:46,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:46,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:46,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:47,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:47,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:47,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 121 conjunts are in the unsatisfiable core [2019-03-04 16:24:47,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:47,088 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:47,089 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,123 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:47,124 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:48,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:48,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2019-03-04 16:24:48,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-03-04 16:24:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-03-04 16:24:48,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:24:48,482 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-03-04 16:24:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:48,757 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-03-04 16:24:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:24:48,758 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-03-04 16:24:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:48,759 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:24:48,759 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:24:48,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:24:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:24:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-03-04 16:24:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:24:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-03-04 16:24:48,765 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-03-04 16:24:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:48,765 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-03-04 16:24:48,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-03-04 16:24:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-03-04 16:24:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:24:48,766 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:48,766 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-03-04 16:24:48,766 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-03-04 16:24:48,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:48,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:50,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:50,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:50,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:50,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:50,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:50,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 124 conjunts are in the unsatisfiable core [2019-03-04 16:24:50,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:50,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:50,151 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,165 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,165 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:51,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:51,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2019-03-04 16:24:51,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:24:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:24:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:24:51,241 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-03-04 16:24:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:51,543 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-03-04 16:24:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-03-04 16:24:51,544 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-03-04 16:24:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:51,545 INFO L225 Difference]: With dead ends: 163 [2019-03-04 16:24:51,545 INFO L226 Difference]: Without dead ends: 162 [2019-03-04 16:24:51,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:24:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-03-04 16:24:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-03-04 16:24:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:24:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-03-04 16:24:51,551 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-03-04 16:24:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:51,551 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-03-04 16:24:51,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:24:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-03-04 16:24:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-03-04 16:24:51,552 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:51,553 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-03-04 16:24:51,553 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-03-04 16:24:51,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:51,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:51,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:51,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:53,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:53,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:53,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-03-04 16:24:53,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:53,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 127 conjunts are in the unsatisfiable core [2019-03-04 16:24:53,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:53,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:53,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,372 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,372 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:54,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:54,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2019-03-04 16:24:54,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-03-04 16:24:54,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-03-04 16:24:54,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2019-03-04 16:24:54,716 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-03-04 16:24:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:55,217 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-03-04 16:24:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-03-04 16:24:55,217 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-03-04 16:24:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:55,218 INFO L225 Difference]: With dead ends: 167 [2019-03-04 16:24:55,219 INFO L226 Difference]: Without dead ends: 166 [2019-03-04 16:24:55,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2019-03-04 16:24:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-03-04 16:24:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-03-04 16:24:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-03-04 16:24:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-03-04 16:24:55,225 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-03-04 16:24:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:55,225 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-03-04 16:24:55,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-03-04 16:24:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-03-04 16:24:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-03-04 16:24:55,226 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:55,226 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-03-04 16:24:55,226 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-03-04 16:24:55,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:55,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:56,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:56,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:56,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:56,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:56,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:56,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 130 conjunts are in the unsatisfiable core [2019-03-04 16:24:56,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:56,474 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:56,475 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,539 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:56,540 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:24:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:57,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2019-03-04 16:24:57,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-03-04 16:24:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-03-04 16:24:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2019-03-04 16:24:57,704 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-03-04 16:24:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:57,957 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-03-04 16:24:57,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-03-04 16:24:57,957 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-03-04 16:24:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:57,959 INFO L225 Difference]: With dead ends: 171 [2019-03-04 16:24:57,959 INFO L226 Difference]: Without dead ends: 170 [2019-03-04 16:24:57,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2019-03-04 16:24:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-03-04 16:24:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-03-04 16:24:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-03-04 16:24:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-03-04 16:24:57,964 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-03-04 16:24:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:57,964 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-03-04 16:24:57,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-03-04 16:24:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-03-04 16:24:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-03-04 16:24:57,965 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:57,966 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-03-04 16:24:57,966 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-03-04 16:24:57,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:57,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:59,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:59,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:59,382 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:59,533 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-03-04 16:24:59,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:59,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 133 conjunts are in the unsatisfiable core [2019-03-04 16:24:59,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:59,573 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:59,574 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,666 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,666 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:00,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:00,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2019-03-04 16:25:00,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:25:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:25:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:25:00,973 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-03-04 16:25:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:01,319 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-03-04 16:25:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:25:01,320 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-03-04 16:25:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:01,321 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:25:01,321 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:25:01,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:25:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:25:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-03-04 16:25:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-03-04 16:25:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-03-04 16:25:01,329 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-03-04 16:25:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:01,329 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-03-04 16:25:01,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:25:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-03-04 16:25:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-03-04 16:25:01,331 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:01,331 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-03-04 16:25:01,331 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-03-04 16:25:01,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:01,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:01,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:02,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 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:02,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:02,772 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-03-04 16:25:02,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:02,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 136 conjunts are in the unsatisfiable core [2019-03-04 16:25:02,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:02,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:25:02,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,794 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:02,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:04,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2019-03-04 16:25:04,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-03-04 16:25:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-03-04 16:25:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2019-03-04 16:25:04,325 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-03-04 16:25:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:04,906 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-03-04 16:25:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-03-04 16:25:04,907 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-03-04 16:25:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:04,908 INFO L225 Difference]: With dead ends: 179 [2019-03-04 16:25:04,908 INFO L226 Difference]: Without dead ends: 178 [2019-03-04 16:25:04,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2019-03-04 16:25:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-03-04 16:25:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-03-04 16:25:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-03-04 16:25:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-03-04 16:25:04,915 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-03-04 16:25:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:04,916 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-03-04 16:25:04,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-03-04 16:25:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-03-04 16:25:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-03-04 16:25:04,917 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:04,917 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-03-04 16:25:04,917 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-03-04 16:25:04,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:04,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:06,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:06,100 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:06,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:06,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 16:25:06,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:06,168 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:06,168 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,180 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:06,181 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:07,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:07,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2019-03-04 16:25:07,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-03-04 16:25:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-03-04 16:25:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2019-03-04 16:25:07,475 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-03-04 16:25:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:07,748 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-03-04 16:25:07,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-03-04 16:25:07,749 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-03-04 16:25:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:07,750 INFO L225 Difference]: With dead ends: 183 [2019-03-04 16:25:07,750 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:25:07,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2019-03-04 16:25:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:25:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 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 176 [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 90 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,756 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-03-04 16:25:07,756 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-03-04 16:25:07,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:09,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:09,326 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:09,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:09,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:09,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:09,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 142 conjunts are in the unsatisfiable core [2019-03-04 16:25:09,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:09,396 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:09,396 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,404 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,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:10,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:10,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2019-03-04 16:25:10,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:25:10,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:25:10,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:25:10,777 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-03-04 16:25:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:11,052 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-03-04 16:25:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:25:11,052 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-03-04 16:25:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:11,054 INFO L225 Difference]: With dead ends: 187 [2019-03-04 16:25:11,054 INFO L226 Difference]: Without dead ends: 186 [2019-03-04 16:25:11,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:25:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-03-04 16:25:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-03-04 16:25:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:25:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-03-04 16:25:11,059 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-03-04 16:25:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:11,060 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-03-04 16:25:11,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:25:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-03-04 16:25:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-03-04 16:25:11,061 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:11,061 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-03-04 16:25:11,061 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:11,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-03-04 16:25:11,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:11,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:12,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:12,426 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:12,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:12,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-03-04 16:25:12,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:12,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 145 conjunts are in the unsatisfiable core [2019-03-04 16:25:12,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:12,609 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,609 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,619 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,620 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:14,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:14,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2019-03-04 16:25:14,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-03-04 16:25:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-03-04 16:25:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:25:14,437 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-03-04 16:25:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:14,751 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-03-04 16:25:14,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:25:14,752 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-03-04 16:25:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:14,753 INFO L225 Difference]: With dead ends: 191 [2019-03-04 16:25:14,753 INFO L226 Difference]: Without dead ends: 190 [2019-03-04 16:25:14,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:25:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-03-04 16:25:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-03-04 16:25:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-03-04 16:25:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-03-04 16:25:14,759 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-03-04 16:25:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:14,759 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-03-04 16:25:14,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-03-04 16:25:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-03-04 16:25:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-03-04 16:25:14,761 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:14,761 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-03-04 16:25:14,761 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-03-04 16:25:14,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:14,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:14,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:14,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:14,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:16,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:16,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:16,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:16,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:16,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:16,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 148 conjunts are in the unsatisfiable core [2019-03-04 16:25:16,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:16,463 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:16,464 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,479 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:16,479 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:18,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:18,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2019-03-04 16:25:18,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-03-04 16:25:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-03-04 16:25:18,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2019-03-04 16:25:18,888 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-03-04 16:25:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:19,376 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-03-04 16:25:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-03-04 16:25:19,376 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-03-04 16:25:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:19,378 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:25:19,378 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:25:19,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2019-03-04 16:25:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:25:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-03-04 16:25:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-03-04 16:25:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-03-04 16:25:19,383 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-03-04 16:25:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:19,384 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-03-04 16:25:19,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-03-04 16:25:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-03-04 16:25:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-03-04 16:25:19,385 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:19,385 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-03-04 16:25:19,386 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-03-04 16:25:19,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:19,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:21,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:21,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:25:21,376 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-03-04 16:25:21,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:21,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 151 conjunts are in the unsatisfiable core [2019-03-04 16:25:21,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:21,409 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:21,410 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,501 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,501 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:23,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:23,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2019-03-04 16:25:23,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-03-04 16:25:23,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-03-04 16:25:23,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:25:23,104 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-03-04 16:25:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:23,511 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-03-04 16:25:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:25:23,512 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-03-04 16:25:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:23,513 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:25:23,513 INFO L226 Difference]: Without dead ends: 198 [2019-03-04 16:25:23,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:25:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-03-04 16:25:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-03-04 16:25:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-03-04 16:25:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-03-04 16:25:23,519 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-03-04 16:25:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:23,520 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-03-04 16:25:23,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-03-04 16:25:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-03-04 16:25:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-03-04 16:25:23,521 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:23,521 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-03-04 16:25:23,521 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:23,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-03-04 16:25:23,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:23,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:23,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:23,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:25,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:25,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:25,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:25,416 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-03-04 16:25:25,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:25,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 154 conjunts are in the unsatisfiable core [2019-03-04 16:25:25,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:25,427 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:25,427 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,439 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:25,440 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:26,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:26,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2019-03-04 16:25:26,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-03-04 16:25:26,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-03-04 16:25:26,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2019-03-04 16:25:26,994 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-03-04 16:25:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:27,359 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-03-04 16:25:27,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:25:27,360 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-03-04 16:25:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:27,361 INFO L225 Difference]: With dead ends: 203 [2019-03-04 16:25:27,361 INFO L226 Difference]: Without dead ends: 202 [2019-03-04 16:25:27,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2019-03-04 16:25:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-03-04 16:25:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-03-04 16:25:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-03-04 16:25:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-03-04 16:25:27,367 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-03-04 16:25:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:27,367 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-03-04 16:25:27,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-03-04 16:25:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-03-04 16:25:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-03-04 16:25:27,368 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:27,368 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-03-04 16:25:27,369 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:27,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-03-04 16:25:27,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:27,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:27,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:28,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:28,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:28,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:28,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 157 conjunts are in the unsatisfiable core [2019-03-04 16:25:28,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:28,962 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:28,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,974 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:28,974 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:30,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:30,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2019-03-04 16:25:30,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-03-04 16:25:30,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-03-04 16:25:30,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:25:30,799 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-03-04 16:25:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:31,126 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-03-04 16:25:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:25:31,127 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-03-04 16:25:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:31,129 INFO L225 Difference]: With dead ends: 207 [2019-03-04 16:25:31,129 INFO L226 Difference]: Without dead ends: 206 [2019-03-04 16:25:31,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:25:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-03-04 16:25:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-03-04 16:25:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-03-04 16:25:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-03-04 16:25:31,137 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-03-04 16:25:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:31,137 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-03-04 16:25:31,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-03-04 16:25:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-03-04 16:25:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-03-04 16:25:31,139 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:31,139 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-03-04 16:25:31,139 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-03-04 16:25:31,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:31,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:32,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:32,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:32,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:32,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:32,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:32,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 160 conjunts are in the unsatisfiable core [2019-03-04 16:25:32,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:32,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:32,836 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,849 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:32,849 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:35,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:35,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2019-03-04 16:25:35,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:25:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:25:35,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:25:35,022 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-03-04 16:25:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:35,353 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-03-04 16:25:35,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-03-04 16:25:35,353 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-03-04 16:25:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:35,355 INFO L225 Difference]: With dead ends: 211 [2019-03-04 16:25:35,356 INFO L226 Difference]: Without dead ends: 210 [2019-03-04 16:25:35,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:25:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-03-04 16:25:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-03-04 16:25:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-03-04 16:25:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-03-04 16:25:35,361 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-03-04 16:25:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:35,362 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-03-04 16:25:35,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:25:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-03-04 16:25:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-03-04 16:25:35,363 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:35,363 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-03-04 16:25:35,363 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:35,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-03-04 16:25:35,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:35,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:35,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:37,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:37,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:37,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:37,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-03-04 16:25:37,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:37,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:25:37,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:37,556 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:37,557 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,585 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:37,585 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:39,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:39,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2019-03-04 16:25:39,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-03-04 16:25:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-03-04 16:25:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:25:39,253 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-03-04 16:25:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:39,636 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-03-04 16:25:39,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:25:39,637 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-03-04 16:25:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:39,638 INFO L225 Difference]: With dead ends: 215 [2019-03-04 16:25:39,638 INFO L226 Difference]: Without dead ends: 214 [2019-03-04 16:25:39,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:25:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-03-04 16:25:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-03-04 16:25:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-03-04 16:25:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-03-04 16:25:39,644 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-03-04 16:25:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:39,644 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-03-04 16:25:39,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-03-04 16:25:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-03-04 16:25:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-03-04 16:25:39,646 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:39,646 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-03-04 16:25:39,646 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-03-04 16:25:39,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:39,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:39,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:41,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:41,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:41,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:41,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:41,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 166 conjunts are in the unsatisfiable core [2019-03-04 16:25:41,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:41,621 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,621 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,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:41,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:43,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:43,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2019-03-04 16:25:43,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-03-04 16:25:43,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-03-04 16:25:43,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2019-03-04 16:25:43,379 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-03-04 16:25:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:43,737 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-03-04 16:25:43,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:25:43,738 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-03-04 16:25:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:43,739 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:25:43,739 INFO L226 Difference]: Without dead ends: 218 [2019-03-04 16:25:43,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2019-03-04 16:25:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-03-04 16:25:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-03-04 16:25:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:25:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-03-04 16:25:43,746 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-03-04 16:25:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:43,746 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-03-04 16:25:43,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-03-04 16:25:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-03-04 16:25:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:25:43,748 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:43,748 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-03-04 16:25:43,748 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:43,748 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-03-04 16:25:43,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:43,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:43,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:43,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:43,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:45,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:45,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:45,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:25:46,106 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-03-04 16:25:46,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:46,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 169 conjunts are in the unsatisfiable core [2019-03-04 16:25:46,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:46,116 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:46,117 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:46,127 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:46,127 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:47,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:47,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2019-03-04 16:25:47,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-03-04 16:25:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-03-04 16:25:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:25:47,921 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-03-04 16:25:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:48,284 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-03-04 16:25:48,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:25:48,285 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-03-04 16:25:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:48,286 INFO L225 Difference]: With dead ends: 223 [2019-03-04 16:25:48,286 INFO L226 Difference]: Without dead ends: 222 [2019-03-04 16:25:48,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:25:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-03-04 16:25:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-03-04 16:25:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-03-04 16:25:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-03-04 16:25:48,291 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-03-04 16:25:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:48,291 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-03-04 16:25:48,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-03-04 16:25:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-03-04 16:25:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-03-04 16:25:48,292 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:48,292 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-03-04 16:25:48,292 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-03-04 16:25:48,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:48,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:48,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:50,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:50,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:50,423 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-03-04 16:25:50,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:50,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 172 conjunts are in the unsatisfiable core [2019-03-04 16:25:50,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:50,432 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:50,432 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,439 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:50,439 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:52,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:52,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2019-03-04 16:25:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-03-04 16:25:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-03-04 16:25:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2019-03-04 16:25:52,322 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-03-04 16:25:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:52,645 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-03-04 16:25:52,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-03-04 16:25:52,645 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-03-04 16:25:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:52,647 INFO L225 Difference]: With dead ends: 227 [2019-03-04 16:25:52,647 INFO L226 Difference]: Without dead ends: 226 [2019-03-04 16:25:52,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2019-03-04 16:25:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-03-04 16:25:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-03-04 16:25:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-03-04 16:25:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-03-04 16:25:52,653 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-03-04 16:25:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:52,653 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-03-04 16:25:52,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-03-04 16:25:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-03-04 16:25:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-03-04 16:25:52,655 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:52,655 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-03-04 16:25:52,655 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-03-04 16:25:52,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:52,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:52,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:54,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:54,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:54,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:54,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 175 conjunts are in the unsatisfiable core [2019-03-04 16:25:54,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:54,523 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:54,524 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,538 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:54,538 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:25:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:56,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:56,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2019-03-04 16:25:56,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-03-04 16:25:56,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-03-04 16:25:56,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:25:56,721 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-03-04 16:25:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:57,131 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-03-04 16:25:57,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:25:57,132 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-03-04 16:25:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:57,134 INFO L225 Difference]: With dead ends: 231 [2019-03-04 16:25:57,134 INFO L226 Difference]: Without dead ends: 230 [2019-03-04 16:25:57,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:25:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-03-04 16:25:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-03-04 16:25:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-03-04 16:25:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-03-04 16:25:57,141 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-03-04 16:25:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:57,141 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-03-04 16:25:57,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-03-04 16:25:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-03-04 16:25:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-03-04 16:25:57,142 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:57,143 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-03-04 16:25:57,143 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-03-04 16:25:57,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:57,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:57,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:57,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:57,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:59,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:59,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:59,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:59,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:59,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:59,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 178 conjunts are in the unsatisfiable core [2019-03-04 16:25:59,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:59,247 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:59,247 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,257 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:59,257 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:01,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2019-03-04 16:26:01,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-03-04 16:26:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-03-04 16:26:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:26:01,616 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-03-04 16:26:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:02,045 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-03-04 16:26:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:26:02,046 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-03-04 16:26:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:02,047 INFO L225 Difference]: With dead ends: 235 [2019-03-04 16:26:02,047 INFO L226 Difference]: Without dead ends: 234 [2019-03-04 16:26:02,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:26:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-03-04 16:26:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-03-04 16:26:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-03-04 16:26:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-03-04 16:26:02,052 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-03-04 16:26:02,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:02,052 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-03-04 16:26:02,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-03-04 16:26:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-03-04 16:26:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-03-04 16:26:02,054 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:02,054 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-03-04 16:26:02,054 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:02,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-03-04 16:26:02,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:02,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:02,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:02,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:04,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:04,533 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:26:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:04,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-03-04 16:26:04,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:04,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 181 conjunts are in the unsatisfiable core [2019-03-04 16:26:04,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:04,807 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,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,815 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,816 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:07,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2019-03-04 16:26:07,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-03-04 16:26:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-03-04 16:26:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:26:07,190 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-03-04 16:26:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:07,593 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-03-04 16:26:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:26:07,594 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-03-04 16:26:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:07,595 INFO L225 Difference]: With dead ends: 239 [2019-03-04 16:26:07,595 INFO L226 Difference]: Without dead ends: 238 [2019-03-04 16:26:07,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:26:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-03-04 16:26:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-03-04 16:26:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-03-04 16:26:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-03-04 16:26:07,601 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-03-04 16:26:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:07,601 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-03-04 16:26:07,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-03-04 16:26:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-03-04 16:26:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-03-04 16:26:07,602 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:07,602 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-03-04 16:26:07,602 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:07,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:07,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-03-04 16:26:07,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:07,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:07,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:07,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:07,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:09,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:09,625 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:26:09,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:26:09,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:26:09,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:09,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 184 conjunts are in the unsatisfiable core [2019-03-04 16:26:09,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:09,715 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:09,715 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,723 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:09,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:12,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:12,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2019-03-04 16:26:12,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-03-04 16:26:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-03-04 16:26:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:26:12,076 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-03-04 16:26:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:12,495 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-03-04 16:26:12,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-03-04 16:26:12,495 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-03-04 16:26:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:12,497 INFO L225 Difference]: With dead ends: 243 [2019-03-04 16:26:12,497 INFO L226 Difference]: Without dead ends: 242 [2019-03-04 16:26:12,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:26:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-03-04 16:26:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-03-04 16:26:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:26:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-03-04 16:26:12,502 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-03-04 16:26:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:12,502 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-03-04 16:26:12,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-03-04 16:26:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-03-04 16:26:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:26:12,503 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:12,503 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-03-04 16:26:12,504 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-03-04 16:26:12,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:12,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:12,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:12,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:14,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:14,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:14,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:26:14,677 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-03-04 16:26:14,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:14,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 187 conjunts are in the unsatisfiable core [2019-03-04 16:26:14,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:14,695 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:14,696 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:14,703 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:14,704 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:17,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:17,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2019-03-04 16:26:17,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-03-04 16:26:17,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-03-04 16:26:17,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:26:17,171 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-03-04 16:26:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:17,550 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-03-04 16:26:17,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:26:17,551 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-03-04 16:26:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:17,552 INFO L225 Difference]: With dead ends: 247 [2019-03-04 16:26:17,552 INFO L226 Difference]: Without dead ends: 246 [2019-03-04 16:26:17,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:26:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-03-04 16:26:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-03-04 16:26:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-03-04 16:26:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-03-04 16:26:17,558 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-03-04 16:26:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:17,558 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-03-04 16:26:17,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-03-04 16:26:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-03-04 16:26:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-03-04 16:26:17,560 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:17,560 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-03-04 16:26:17,560 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-03-04 16:26:17,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:17,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:19,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:19,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:19,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:26:19,968 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-03-04 16:26:19,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:19,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 190 conjunts are in the unsatisfiable core [2019-03-04 16:26:19,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:19,980 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:19,980 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,003 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:20,003 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:22,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:22,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2019-03-04 16:26:22,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-03-04 16:26:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-03-04 16:26:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2019-03-04 16:26:22,511 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-03-04 16:26:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:22,996 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-03-04 16:26:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:26:22,996 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-03-04 16:26:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:22,997 INFO L225 Difference]: With dead ends: 251 [2019-03-04 16:26:22,997 INFO L226 Difference]: Without dead ends: 250 [2019-03-04 16:26:22,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2019-03-04 16:26:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-03-04 16:26:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-03-04 16:26:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-03-04 16:26:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-03-04 16:26:23,004 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-03-04 16:26:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:23,004 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-03-04 16:26:23,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-03-04 16:26:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-03-04 16:26:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-03-04 16:26:23,005 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:23,006 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-03-04 16:26:23,006 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-03-04 16:26:23,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:23,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:23,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:23,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:25,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:25,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:25,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 193 conjunts are in the unsatisfiable core [2019-03-04 16:26:25,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:25,269 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:25,269 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,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:26:25,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:27,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:27,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2019-03-04 16:26:27,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-03-04 16:26:27,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-03-04 16:26:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:26:27,812 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-03-04 16:26:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:28,246 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-03-04 16:26:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:26:28,247 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-03-04 16:26:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:28,248 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:26:28,248 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 16:26:28,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:26:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 16:26:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-03-04 16:26:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-03-04 16:26:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-03-04 16:26:28,254 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-03-04 16:26:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:28,254 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-03-04 16:26:28,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-03-04 16:26:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-03-04 16:26:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-03-04 16:26:28,255 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:28,255 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-03-04 16:26:28,255 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-03-04 16:26:28,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:28,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:28,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:28,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:28,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:30,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:30,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:30,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:30,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:30,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 196 conjunts are in the unsatisfiable core [2019-03-04 16:26:30,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:30,573 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:30,573 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,584 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:30,584 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:33,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:33,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2019-03-04 16:26:33,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:26:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:26:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:26:33,206 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-03-04 16:26:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:33,647 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-03-04 16:26:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:26:33,648 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-03-04 16:26:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:33,650 INFO L225 Difference]: With dead ends: 259 [2019-03-04 16:26:33,650 INFO L226 Difference]: Without dead ends: 258 [2019-03-04 16:26:33,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:26:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-03-04 16:26:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-03-04 16:26:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-03-04 16:26:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-03-04 16:26:33,656 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-03-04 16:26:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:33,656 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-03-04 16:26:33,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:26:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-03-04 16:26:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-03-04 16:26:33,657 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:33,658 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-03-04 16:26:33,658 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-03-04 16:26:33,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:36,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:36,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:36,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:36,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-03-04 16:26:36,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:36,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2019-03-04 16:26:36,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:36,419 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:36,419 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,431 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,432 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:38,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:38,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2019-03-04 16:26:38,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-03-04 16:26:38,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-03-04 16:26:38,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2019-03-04 16:26:38,824 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-03-04 16:26:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:39,284 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-03-04 16:26:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-03-04 16:26:39,284 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-03-04 16:26:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:39,286 INFO L225 Difference]: With dead ends: 263 [2019-03-04 16:26:39,286 INFO L226 Difference]: Without dead ends: 262 [2019-03-04 16:26:39,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2019-03-04 16:26:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-03-04 16:26:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-03-04 16:26:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-03-04 16:26:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-03-04 16:26:39,293 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-03-04 16:26:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:39,293 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-03-04 16:26:39,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-03-04 16:26:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-03-04 16:26:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-03-04 16:26:39,295 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:39,295 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-03-04 16:26:39,295 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-03-04 16:26:39,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:39,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:39,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:41,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:41,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:41,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:26:41,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:26:41,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:41,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 202 conjunts are in the unsatisfiable core [2019-03-04 16:26:41,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:42,008 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,009 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,020 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,021 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:44,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:44,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2019-03-04 16:26:44,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-03-04 16:26:44,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-03-04 16:26:44,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2019-03-04 16:26:44,815 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-03-04 16:26:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:45,290 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-03-04 16:26:45,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:26:45,291 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-03-04 16:26:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:45,292 INFO L225 Difference]: With dead ends: 267 [2019-03-04 16:26:45,293 INFO L226 Difference]: Without dead ends: 266 [2019-03-04 16:26:45,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2019-03-04 16:26:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-03-04 16:26:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-03-04 16:26:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-03-04 16:26:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-03-04 16:26:45,299 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-03-04 16:26:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:45,300 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-03-04 16:26:45,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-03-04 16:26:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-03-04 16:26:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-03-04 16:26:45,301 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:45,301 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-03-04 16:26:45,302 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:45,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-03-04 16:26:45,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:45,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:45,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:45,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:45,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:48,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:48,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:48,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:26:48,244 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-03-04 16:26:48,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:48,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 205 conjunts are in the unsatisfiable core [2019-03-04 16:26:48,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:48,257 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,257 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,269 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,270 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:50,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:50,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2019-03-04 16:26:50,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-03-04 16:26:50,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-03-04 16:26:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:26:50,806 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-03-04 16:26:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:51,340 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-03-04 16:26:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:26:51,340 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-03-04 16:26:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:51,341 INFO L225 Difference]: With dead ends: 271 [2019-03-04 16:26:51,341 INFO L226 Difference]: Without dead ends: 270 [2019-03-04 16:26:51,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:26:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-03-04 16:26:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-03-04 16:26:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-03-04 16:26:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-03-04 16:26:51,348 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-03-04 16:26:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:51,348 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-03-04 16:26:51,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-03-04 16:26:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-03-04 16:26:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-03-04 16:26:51,350 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:51,350 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-03-04 16:26:51,350 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-03-04 16:26:51,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:51,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:51,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:53,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:53,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:53,882 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:26:54,188 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-03-04 16:26:54,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:54,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 208 conjunts are in the unsatisfiable core [2019-03-04 16:26:54,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:54,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:26:54,200 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,212 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,212 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:26:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:57,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:57,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2019-03-04 16:26:57,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-03-04 16:26:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-03-04 16:26:57,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2019-03-04 16:26:57,203 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-03-04 16:26:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:57,738 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-03-04 16:26:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-03-04 16:26:57,738 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-03-04 16:26:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:57,740 INFO L225 Difference]: With dead ends: 275 [2019-03-04 16:26:57,740 INFO L226 Difference]: Without dead ends: 274 [2019-03-04 16:26:57,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2019-03-04 16:26:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-03-04 16:26:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-03-04 16:26:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-03-04 16:26:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-03-04 16:26:57,745 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-03-04 16:26:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:57,746 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-03-04 16:26:57,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-03-04 16:26:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-03-04 16:26:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-03-04 16:26:57,747 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:57,747 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-03-04 16:26:57,747 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-03-04 16:26:57,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:57,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:57,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:57,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:00,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:00,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:00,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:00,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 211 conjunts are in the unsatisfiable core [2019-03-04 16:27:00,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:00,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:27:00,355 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,367 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,367 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:03,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:03,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2019-03-04 16:27:03,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-03-04 16:27:03,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-03-04 16:27:03,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2019-03-04 16:27:03,194 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-03-04 16:27:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:03,627 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-03-04 16:27:03,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 16:27:03,627 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-03-04 16:27:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:03,629 INFO L225 Difference]: With dead ends: 279 [2019-03-04 16:27:03,629 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 16:27:03,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2019-03-04 16:27:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 16:27:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-03-04 16:27:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-03-04 16:27:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-03-04 16:27:03,636 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-03-04 16:27:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:03,636 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-03-04 16:27:03,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-03-04 16:27:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-03-04 16:27:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-03-04 16:27:03,638 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:03,638 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-03-04 16:27:03,638 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-03-04 16:27:03,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:03,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:03,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:06,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:06,258 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:27:06,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:06,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:06,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:06,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 214 conjunts are in the unsatisfiable core [2019-03-04 16:27:06,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:06,350 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:06,350 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,357 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,357 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:09,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:09,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2019-03-04 16:27:09,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-03-04 16:27:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-03-04 16:27:09,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:27:09,348 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-03-04 16:27:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:09,846 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-03-04 16:27:09,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-03-04 16:27:09,847 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-03-04 16:27:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:09,849 INFO L225 Difference]: With dead ends: 283 [2019-03-04 16:27:09,849 INFO L226 Difference]: Without dead ends: 282 [2019-03-04 16:27:09,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:27:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-03-04 16:27:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-03-04 16:27:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-03-04 16:27:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-03-04 16:27:09,855 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-03-04 16:27:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:09,855 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-03-04 16:27:09,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-03-04 16:27:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-03-04 16:27:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-03-04 16:27:09,857 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:09,857 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-03-04 16:27:09,857 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-03-04 16:27:09,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:09,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:12,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:12,602 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:27:12,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:12,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-03-04 16:27:12,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:12,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 217 conjunts are in the unsatisfiable core [2019-03-04 16:27:12,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:12,965 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:12,966 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,978 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,978 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:15,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:15,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2019-03-04 16:27:15,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-03-04 16:27:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-03-04 16:27:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 16:27:15,836 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-03-04 16:27:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:16,308 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-03-04 16:27:16,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:27:16,309 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-03-04 16:27:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:16,311 INFO L225 Difference]: With dead ends: 287 [2019-03-04 16:27:16,311 INFO L226 Difference]: Without dead ends: 286 [2019-03-04 16:27:16,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 16:27:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-03-04 16:27:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-03-04 16:27:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-03-04 16:27:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-03-04 16:27:16,317 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-03-04 16:27:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:16,317 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-03-04 16:27:16,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-03-04 16:27:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-03-04 16:27:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-03-04 16:27:16,318 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:16,318 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-03-04 16:27:16,318 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-03-04 16:27:16,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:16,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:19,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:19,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:19,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:27:19,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:27:19,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:19,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 220 conjunts are in the unsatisfiable core [2019-03-04 16:27:19,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:19,431 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:19,431 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,441 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,441 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:22,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:22,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2019-03-04 16:27:22,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-03-04 16:27:22,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-03-04 16:27:22,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2019-03-04 16:27:22,514 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-03-04 16:27:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:23,116 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-03-04 16:27:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-03-04 16:27:23,116 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-03-04 16:27:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:23,118 INFO L225 Difference]: With dead ends: 291 [2019-03-04 16:27:23,118 INFO L226 Difference]: Without dead ends: 290 [2019-03-04 16:27:23,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2019-03-04 16:27:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-03-04 16:27:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-03-04 16:27:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-03-04 16:27:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-03-04 16:27:23,123 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-03-04 16:27:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:23,124 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-03-04 16:27:23,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-03-04 16:27:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-03-04 16:27:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-03-04 16:27:23,125 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:23,125 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-03-04 16:27:23,125 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:23,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-03-04 16:27:23,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:23,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:23,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:23,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:23,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:25,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:25,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:25,940 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:27:26,170 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-03-04 16:27:26,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:26,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 223 conjunts are in the unsatisfiable core [2019-03-04 16:27:26,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:26,184 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:26,184 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,192 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:26,192 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:29,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:29,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2019-03-04 16:27:29,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-03-04 16:27:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-03-04 16:27:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:27:29,314 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-03-04 16:27:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:29,838 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-03-04 16:27:29,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-03-04 16:27:29,838 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-03-04 16:27:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:29,840 INFO L225 Difference]: With dead ends: 295 [2019-03-04 16:27:29,840 INFO L226 Difference]: Without dead ends: 294 [2019-03-04 16:27:29,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:27:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-03-04 16:27:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-03-04 16:27:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-03-04 16:27:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-03-04 16:27:29,845 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-03-04 16:27:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:29,845 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-03-04 16:27:29,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-03-04 16:27:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-03-04 16:27:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-03-04 16:27:29,847 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:29,847 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-03-04 16:27:29,847 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-03-04 16:27:29,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:29,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:32,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:32,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:32,852 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:27:33,213 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-03-04 16:27:33,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:33,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 226 conjunts are in the unsatisfiable core [2019-03-04 16:27:33,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:33,231 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,231 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,242 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,242 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:36,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:36,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2019-03-04 16:27:36,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-03-04 16:27:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-03-04 16:27:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2019-03-04 16:27:36,314 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-03-04 16:27:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:36,791 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-03-04 16:27:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:27:36,792 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-03-04 16:27:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:36,794 INFO L225 Difference]: With dead ends: 299 [2019-03-04 16:27:36,794 INFO L226 Difference]: Without dead ends: 298 [2019-03-04 16:27:36,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2019-03-04 16:27:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-03-04 16:27:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-03-04 16:27:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-03-04 16:27:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-03-04 16:27:36,800 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-03-04 16:27:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:36,800 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-03-04 16:27:36,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-03-04 16:27:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-03-04 16:27:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-03-04 16:27:36,801 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:36,801 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-03-04 16:27:36,802 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-03-04 16:27:36,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:36,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:36,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:39,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:39,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:39,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:40,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 229 conjunts are in the unsatisfiable core [2019-03-04 16:27:40,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:40,039 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:40,039 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:40,052 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:40,052 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:43,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:43,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2019-03-04 16:27:43,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-03-04 16:27:43,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-03-04 16:27:43,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:27:43,351 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-03-04 16:27:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:43,821 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-03-04 16:27:43,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:27:43,821 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-03-04 16:27:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:43,823 INFO L225 Difference]: With dead ends: 303 [2019-03-04 16:27:43,823 INFO L226 Difference]: Without dead ends: 302 [2019-03-04 16:27:43,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:27:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-03-04 16:27:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-03-04 16:27:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-03-04 16:27:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-03-04 16:27:43,829 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-03-04 16:27:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:43,829 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-03-04 16:27:43,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-03-04 16:27:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-03-04 16:27:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-03-04 16:27:43,830 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:43,830 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-03-04 16:27:43,831 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-03-04 16:27:43,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:43,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:43,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:46,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:46,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:46,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:47,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:47,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:47,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 232 conjunts are in the unsatisfiable core [2019-03-04 16:27:47,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:47,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:27:47,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,032 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,032 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:50,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:50,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2019-03-04 16:27:50,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-03-04 16:27:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-03-04 16:27:50,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:27:50,373 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-03-04 16:27:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:50,894 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-03-04 16:27:50,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-03-04 16:27:50,894 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-03-04 16:27:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:50,896 INFO L225 Difference]: With dead ends: 307 [2019-03-04 16:27:50,896 INFO L226 Difference]: Without dead ends: 306 [2019-03-04 16:27:50,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:27:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-03-04 16:27:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-03-04 16:27:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-03-04 16:27:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-03-04 16:27:50,902 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-03-04 16:27:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:50,902 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-03-04 16:27:50,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-03-04 16:27:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-03-04 16:27:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-03-04 16:27:50,903 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:50,904 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-03-04 16:27:50,904 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-03-04 16:27:50,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:50,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:50,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:54,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:54,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:54,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:54,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-03-04 16:27:54,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:54,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 235 conjunts are in the unsatisfiable core [2019-03-04 16:27:54,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:54,690 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:54,690 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,700 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:54,700 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:27:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:58,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:58,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2019-03-04 16:27:58,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-03-04 16:27:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-03-04 16:27:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:27:58,072 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-03-04 16:27:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:58,609 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-03-04 16:27:58,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-03-04 16:27:58,609 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-03-04 16:27:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:58,611 INFO L225 Difference]: With dead ends: 311 [2019-03-04 16:27:58,611 INFO L226 Difference]: Without dead ends: 310 [2019-03-04 16:27:58,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:27:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-03-04 16:27:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-03-04 16:27:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-03-04 16:27:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-03-04 16:27:58,617 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-03-04 16:27:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:58,617 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-03-04 16:27:58,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-03-04 16:27:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-03-04 16:27:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-03-04 16:27:58,618 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:58,618 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-03-04 16:27:58,619 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-03-04 16:27:58,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:58,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:58,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:58,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:01,837 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:28:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:28:01,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:28:01,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:01,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 238 conjunts are in the unsatisfiable core [2019-03-04 16:28:01,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:01,949 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:01,949 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:01,961 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:01,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:05,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:05,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 154 [2019-03-04 16:28:05,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-03-04 16:28:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-03-04 16:28:05,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:28:05,386 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-03-04 16:28:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:05,929 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-03-04 16:28:05,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-03-04 16:28:05,930 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-03-04 16:28:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:05,932 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:28:05,932 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:28:05,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11704 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:28:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:28:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-03-04 16:28:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-03-04 16:28:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-03-04 16:28:05,940 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-03-04 16:28:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:05,940 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-03-04 16:28:05,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-03-04 16:28:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-03-04 16:28:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-03-04 16:28:05,942 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:05,942 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-03-04 16:28:05,942 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:05,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-03-04 16:28:05,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:05,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:05,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:05,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:09,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:09,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:09,332 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:28:09,627 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-03-04 16:28:09,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:09,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 241 conjunts are in the unsatisfiable core [2019-03-04 16:28:09,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:09,640 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:09,641 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:09,650 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:09,650 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 156 [2019-03-04 16:28:13,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-03-04 16:28:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-03-04 16:28:13,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:28:13,150 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-03-04 16:28:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:13,781 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-03-04 16:28:13,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 16:28:13,781 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-03-04 16:28:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:13,783 INFO L225 Difference]: With dead ends: 319 [2019-03-04 16:28:13,784 INFO L226 Difference]: Without dead ends: 318 [2019-03-04 16:28:13,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12012 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:28:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-03-04 16:28:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-03-04 16:28:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-03-04 16:28:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-03-04 16:28:13,790 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-03-04 16:28:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:13,790 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-03-04 16:28:13,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-03-04 16:28:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-03-04 16:28:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-03-04 16:28:13,791 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:13,791 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-03-04 16:28:13,791 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-03-04 16:28:13,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:13,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:13,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:13,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:13,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:17,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:17,173 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:28:17,181 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:28:17,576 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-03-04 16:28:17,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:17,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 244 conjunts are in the unsatisfiable core [2019-03-04 16:28:17,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:17,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:28:17,590 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,600 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:17,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:21,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:21,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 158 [2019-03-04 16:28:21,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-03-04 16:28:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-03-04 16:28:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:28:21,194 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-03-04 16:28:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:21,762 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-03-04 16:28:21,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-03-04 16:28:21,762 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-03-04 16:28:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:21,764 INFO L225 Difference]: With dead ends: 323 [2019-03-04 16:28:21,764 INFO L226 Difference]: Without dead ends: 322 [2019-03-04 16:28:21,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12324 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:28:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-03-04 16:28:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-03-04 16:28:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-03-04 16:28:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-03-04 16:28:21,770 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-03-04 16:28:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:21,771 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-03-04 16:28:21,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-03-04 16:28:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-03-04 16:28:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-03-04 16:28:21,772 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:21,772 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-03-04 16:28:21,772 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-03-04 16:28:21,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:21,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:21,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:25,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:25,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:25,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 247 conjunts are in the unsatisfiable core [2019-03-04 16:28:25,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:25,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:28:25,385 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,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:28:25,400 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:29,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:29,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 160 [2019-03-04 16:28:29,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-03-04 16:28:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-03-04 16:28:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:28:29,172 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-03-04 16:28:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:29,803 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-03-04 16:28:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-03-04 16:28:29,803 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-03-04 16:28:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:29,805 INFO L225 Difference]: With dead ends: 327 [2019-03-04 16:28:29,805 INFO L226 Difference]: Without dead ends: 326 [2019-03-04 16:28:29,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12640 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:28:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-03-04 16:28:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-03-04 16:28:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-03-04 16:28:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-03-04 16:28:29,811 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-03-04 16:28:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:29,812 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-03-04 16:28:29,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-03-04 16:28:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-03-04 16:28:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-03-04 16:28:29,813 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:29,813 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-03-04 16:28:29,813 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-03-04 16:28:29,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:29,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:29,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:29,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:29,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:33,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:33,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:33,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:28:33,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:28:33,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:33,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 250 conjunts are in the unsatisfiable core [2019-03-04 16:28:33,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:33,529 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:33,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:33,539 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:33,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:37,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:37,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 162 [2019-03-04 16:28:37,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-03-04 16:28:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-03-04 16:28:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:28:37,397 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-03-04 16:28:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:37,976 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-03-04 16:28:37,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 16:28:37,977 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-03-04 16:28:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:37,979 INFO L225 Difference]: With dead ends: 331 [2019-03-04 16:28:37,979 INFO L226 Difference]: Without dead ends: 330 [2019-03-04 16:28:37,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12960 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:28:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-03-04 16:28:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-03-04 16:28:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-03-04 16:28:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-03-04 16:28:37,985 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-03-04 16:28:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:37,985 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-03-04 16:28:37,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-03-04 16:28:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-03-04 16:28:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-03-04 16:28:37,986 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:37,987 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-03-04 16:28:37,987 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-03-04 16:28:37,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:37,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:37,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:41,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:41,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:41,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:28:42,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-03-04 16:28:42,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:42,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 253 conjunts are in the unsatisfiable core [2019-03-04 16:28:42,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:42,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:28:42,091 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,101 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:42,101 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:45,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:45,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 164 [2019-03-04 16:28:45,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-03-04 16:28:45,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-03-04 16:28:45,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:28:45,956 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-03-04 16:28:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:46,605 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-03-04 16:28:46,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 16:28:46,606 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-03-04 16:28:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:46,607 INFO L225 Difference]: With dead ends: 335 [2019-03-04 16:28:46,607 INFO L226 Difference]: Without dead ends: 334 [2019-03-04 16:28:46,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13284 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:28:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-03-04 16:28:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-03-04 16:28:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-03-04 16:28:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-03-04 16:28:46,613 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-03-04 16:28:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:46,614 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-03-04 16:28:46,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-03-04 16:28:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-03-04 16:28:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-03-04 16:28:46,615 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:46,615 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-03-04 16:28:46,615 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-03-04 16:28:46,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:46,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:46,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:46,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:46,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:50,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:50,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:50,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:28:50,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:28:50,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:50,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 256 conjunts are in the unsatisfiable core [2019-03-04 16:28:50,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:50,502 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:50,502 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:50,510 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:50,510 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:28:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:54,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:54,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 166 [2019-03-04 16:28:54,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-03-04 16:28:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-03-04 16:28:54,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:28:54,537 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-03-04 16:28:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:55,133 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-03-04 16:28:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-03-04 16:28:55,133 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-03-04 16:28:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:55,135 INFO L225 Difference]: With dead ends: 339 [2019-03-04 16:28:55,136 INFO L226 Difference]: Without dead ends: 338 [2019-03-04 16:28:55,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13612 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:28:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-03-04 16:28:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-03-04 16:28:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-03-04 16:28:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-03-04 16:28:55,142 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-03-04 16:28:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:55,142 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-03-04 16:28:55,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-03-04 16:28:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-03-04 16:28:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-03-04 16:28:55,143 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:55,143 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-03-04 16:28:55,143 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:55,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-03-04 16:28:55,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:55,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:55,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:58,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:58,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:28:59,295 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-03-04 16:28:59,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:59,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 259 conjunts are in the unsatisfiable core [2019-03-04 16:28:59,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:59,307 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:59,308 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,312 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:59,312 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:03,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:03,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 168 [2019-03-04 16:29:03,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-03-04 16:29:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-03-04 16:29:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:29:03,340 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-03-04 16:29:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:03,943 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-03-04 16:29:03,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 16:29:03,944 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-03-04 16:29:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:03,946 INFO L225 Difference]: With dead ends: 343 [2019-03-04 16:29:03,946 INFO L226 Difference]: Without dead ends: 342 [2019-03-04 16:29:03,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13944 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:29:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-03-04 16:29:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-03-04 16:29:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-03-04 16:29:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-03-04 16:29:03,952 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-03-04 16:29:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:03,952 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-03-04 16:29:03,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-03-04 16:29:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-03-04 16:29:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-03-04 16:29:03,953 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:03,953 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-03-04 16:29:03,953 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-03-04 16:29:03,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:03,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:03,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:07,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:07,926 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:29:07,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:29:08,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-03-04 16:29:08,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:08,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 262 conjunts are in the unsatisfiable core [2019-03-04 16:29:08,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:08,351 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:08,351 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,360 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:08,360 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:12,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:12,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 170 [2019-03-04 16:29:12,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-03-04 16:29:12,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-03-04 16:29:12,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:29:12,483 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-03-04 16:29:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:13,091 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-03-04 16:29:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-03-04 16:29:13,091 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-03-04 16:29:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:13,093 INFO L225 Difference]: With dead ends: 347 [2019-03-04 16:29:13,093 INFO L226 Difference]: Without dead ends: 346 [2019-03-04 16:29:13,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:29:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-03-04 16:29:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-03-04 16:29:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-03-04 16:29:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-03-04 16:29:13,100 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-03-04 16:29:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:13,100 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-03-04 16:29:13,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-03-04 16:29:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-03-04 16:29:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-03-04 16:29:13,102 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:13,102 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-03-04 16:29:13,102 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:13,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:13,102 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-03-04 16:29:13,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:13,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:13,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:17,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:17,036 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:29:17,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:17,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 265 conjunts are in the unsatisfiable core [2019-03-04 16:29:17,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:17,144 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:17,144 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:17,157 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:17,157 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:21,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:21,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 172 [2019-03-04 16:29:21,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-03-04 16:29:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-03-04 16:29:21,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:29:21,348 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-03-04 16:29:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:21,939 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-03-04 16:29:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-03-04 16:29:21,940 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-03-04 16:29:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:21,942 INFO L225 Difference]: With dead ends: 351 [2019-03-04 16:29:21,942 INFO L226 Difference]: Without dead ends: 350 [2019-03-04 16:29:21,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14620 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:29:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-03-04 16:29:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-03-04 16:29:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-03-04 16:29:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-03-04 16:29:21,949 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-03-04 16:29:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:21,949 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-03-04 16:29:21,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-03-04 16:29:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-03-04 16:29:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-03-04 16:29:21,951 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:21,951 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-03-04 16:29:21,951 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-03-04 16:29:21,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:21,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:21,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:26,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:26,436 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:29:26,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:29:26,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:29:26,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:26,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 268 conjunts are in the unsatisfiable core [2019-03-04 16:29:26,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:26,548 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:26,549 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,573 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:26,573 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:30,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:30,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 174 [2019-03-04 16:29:30,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-03-04 16:29:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-03-04 16:29:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:29:30,920 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-03-04 16:29:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:31,533 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-03-04 16:29:31,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-03-04 16:29:31,533 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-03-04 16:29:31,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:31,535 INFO L225 Difference]: With dead ends: 355 [2019-03-04 16:29:31,535 INFO L226 Difference]: Without dead ends: 354 [2019-03-04 16:29:31,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14964 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:29:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-03-04 16:29:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-03-04 16:29:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-03-04 16:29:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-03-04 16:29:31,542 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-03-04 16:29:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:31,542 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-03-04 16:29:31,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-03-04 16:29:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-03-04 16:29:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-03-04 16:29:31,544 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:31,544 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-03-04 16:29:31,544 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:31,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:31,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-03-04 16:29:31,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:31,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:31,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:35,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:35,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:35,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:29:36,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-03-04 16:29:36,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:36,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 271 conjunts are in the unsatisfiable core [2019-03-04 16:29:36,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:36,239 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:36,239 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,249 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,249 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:40,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 176 [2019-03-04 16:29:40,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-03-04 16:29:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-03-04 16:29:40,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:29:40,675 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-03-04 16:29:41,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:41,354 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-03-04 16:29:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-03-04 16:29:41,354 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-03-04 16:29:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:41,356 INFO L225 Difference]: With dead ends: 359 [2019-03-04 16:29:41,357 INFO L226 Difference]: Without dead ends: 358 [2019-03-04 16:29:41,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15312 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:29:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-03-04 16:29:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-03-04 16:29:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-03-04 16:29:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-03-04 16:29:41,363 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-03-04 16:29:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:41,363 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-03-04 16:29:41,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-03-04 16:29:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-03-04 16:29:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-03-04 16:29:41,364 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:41,365 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-03-04 16:29:41,365 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:41,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:41,365 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-03-04 16:29:41,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:41,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:41,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:41,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:41,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:45,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:45,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:29:45,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:29:45,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:45,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 274 conjunts are in the unsatisfiable core [2019-03-04 16:29:45,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:45,744 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:45,744 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:45,753 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:45,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:29:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:50,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:50,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 178 [2019-03-04 16:29:50,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-03-04 16:29:50,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-03-04 16:29:50,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:29:50,263 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-03-04 16:29:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:51,079 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-03-04 16:29:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 16:29:51,080 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-03-04 16:29:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:51,082 INFO L225 Difference]: With dead ends: 363 [2019-03-04 16:29:51,082 INFO L226 Difference]: Without dead ends: 362 [2019-03-04 16:29:51,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15664 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:29:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-03-04 16:29:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-03-04 16:29:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-03-04 16:29:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-03-04 16:29:51,089 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-03-04 16:29:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:51,089 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-03-04 16:29:51,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-03-04 16:29:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-03-04 16:29:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-03-04 16:29:51,091 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:51,091 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-03-04 16:29:51,091 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-03-04 16:29:51,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:51,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:51,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:55,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:55,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:55,457 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:29:55,894 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-03-04 16:29:55,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:55,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 277 conjunts are in the unsatisfiable core [2019-03-04 16:29:55,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:55,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:29:55,912 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:55,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:29:55,928 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:00,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 180 [2019-03-04 16:30:00,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-03-04 16:30:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-03-04 16:30:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:30:00,491 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-03-04 16:30:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:01,234 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-03-04 16:30:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-03-04 16:30:01,235 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-03-04 16:30:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:01,237 INFO L225 Difference]: With dead ends: 367 [2019-03-04 16:30:01,237 INFO L226 Difference]: Without dead ends: 366 [2019-03-04 16:30:01,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16020 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:30:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-03-04 16:30:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-03-04 16:30:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-03-04 16:30:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-03-04 16:30:01,244 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-03-04 16:30:01,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:01,245 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-03-04 16:30:01,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-03-04 16:30:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-03-04 16:30:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-03-04 16:30:01,246 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:01,246 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-03-04 16:30:01,246 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-03-04 16:30:01,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:01,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:01,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:01,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:01,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:05,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:05,611 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:30:05,620 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:30:06,173 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-03-04 16:30:06,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:06,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 280 conjunts are in the unsatisfiable core [2019-03-04 16:30:06,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:06,185 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:06,185 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:06,197 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:06,197 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:10,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:10,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 182 [2019-03-04 16:30:10,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-03-04 16:30:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-03-04 16:30:10,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:30:10,942 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-03-04 16:30:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:11,765 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-03-04 16:30:11,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-03-04 16:30:11,766 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-03-04 16:30:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:11,768 INFO L225 Difference]: With dead ends: 371 [2019-03-04 16:30:11,768 INFO L226 Difference]: Without dead ends: 370 [2019-03-04 16:30:11,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16380 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:30:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-03-04 16:30:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-03-04 16:30:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-03-04 16:30:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-03-04 16:30:11,775 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-03-04 16:30:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:11,775 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-03-04 16:30:11,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-03-04 16:30:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-03-04 16:30:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-03-04 16:30:11,776 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:11,777 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-03-04 16:30:11,777 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-03-04 16:30:11,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:11,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:16,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:16,366 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:30:16,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:16,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 283 conjunts are in the unsatisfiable core [2019-03-04 16:30:16,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:16,485 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:16,485 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:16,493 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:16,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:21,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:21,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 184 [2019-03-04 16:30:21,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-03-04 16:30:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-03-04 16:30:21,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:30:21,260 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-03-04 16:30:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:21,917 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-03-04 16:30:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-03-04 16:30:21,917 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-03-04 16:30:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:21,920 INFO L225 Difference]: With dead ends: 375 [2019-03-04 16:30:21,920 INFO L226 Difference]: Without dead ends: 374 [2019-03-04 16:30:21,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16744 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:30:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-03-04 16:30:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-03-04 16:30:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-03-04 16:30:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-03-04 16:30:21,926 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-03-04 16:30:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:21,926 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-03-04 16:30:21,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-03-04 16:30:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-03-04 16:30:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-03-04 16:30:21,927 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:21,928 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-03-04 16:30:21,928 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-03-04 16:30:21,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:21,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:21,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:26,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:26,527 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:30:26,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:30:26,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:30:26,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:26,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 286 conjunts are in the unsatisfiable core [2019-03-04 16:30:26,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:26,658 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:26,658 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:26,667 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:26,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:31,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:31,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 186 [2019-03-04 16:30:31,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-03-04 16:30:31,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-03-04 16:30:31,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:30:31,561 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-03-04 16:30:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:32,328 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-03-04 16:30:32,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 16:30:32,329 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-03-04 16:30:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:32,331 INFO L225 Difference]: With dead ends: 379 [2019-03-04 16:30:32,331 INFO L226 Difference]: Without dead ends: 378 [2019-03-04 16:30:32,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17112 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:30:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-03-04 16:30:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-03-04 16:30:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-03-04 16:30:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-03-04 16:30:32,338 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-03-04 16:30:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:32,338 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-03-04 16:30:32,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-03-04 16:30:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-03-04 16:30:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-03-04 16:30:32,339 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:32,339 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-03-04 16:30:32,339 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:32,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-03-04 16:30:32,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:32,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:32,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:32,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:32,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:37,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:37,077 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:30:37,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:30:37,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-03-04 16:30:37,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:37,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 289 conjunts are in the unsatisfiable core [2019-03-04 16:30:37,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:37,732 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:37,732 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:37,753 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:37,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:42,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 188 [2019-03-04 16:30:42,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-03-04 16:30:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-03-04 16:30:42,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:30:42,743 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-03-04 16:30:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:43,572 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-03-04 16:30:43,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-03-04 16:30:43,573 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-03-04 16:30:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:43,575 INFO L225 Difference]: With dead ends: 383 [2019-03-04 16:30:43,575 INFO L226 Difference]: Without dead ends: 382 [2019-03-04 16:30:43,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:30:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-03-04 16:30:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-03-04 16:30:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-03-04 16:30:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-03-04 16:30:43,583 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-03-04 16:30:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:43,583 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-03-04 16:30:43,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-03-04 16:30:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-03-04 16:30:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-03-04 16:30:43,584 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:43,584 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-03-04 16:30:43,585 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-03-04 16:30:43,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:43,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:43,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:43,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:43,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:48,457 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:30:48,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:48,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:48,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:30:48,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:30:48,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:48,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 292 conjunts are in the unsatisfiable core [2019-03-04 16:30:48,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:48,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:30:48,596 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,608 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:48,608 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:30:53,727 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:30:53,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:53,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 190 [2019-03-04 16:30:53,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-03-04 16:30:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-03-04 16:30:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13871, Invalid=22801, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 16:30:53,750 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-03-04 16:30:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:54,576 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-03-04 16:30:54,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-03-04 16:30:54,577 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-03-04 16:30:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:54,579 INFO L225 Difference]: With dead ends: 387 [2019-03-04 16:30:54,579 INFO L226 Difference]: Without dead ends: 386 [2019-03-04 16:30:54,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17860 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13871, Invalid=22801, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 16:30:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-03-04 16:30:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-03-04 16:30:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-03-04 16:30:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-03-04 16:30:54,587 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-03-04 16:30:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:54,587 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-03-04 16:30:54,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-03-04 16:30:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-03-04 16:30:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-03-04 16:30:54,588 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:54,589 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-03-04 16:30:54,589 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-03-04 16:30:54,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:54,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:54,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:59,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:59,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:31:00,001 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-03-04 16:31:00,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:00,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 295 conjunts are in the unsatisfiable core [2019-03-04 16:31:00,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:00,019 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:00,019 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:00,029 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:00,029 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:05,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:05,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 192 [2019-03-04 16:31:05,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-03-04 16:31:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-03-04 16:31:05,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14161, Invalid=23281, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:31:05,266 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-03-04 16:31:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:06,069 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-03-04 16:31:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-03-04 16:31:06,069 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-03-04 16:31:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:06,072 INFO L225 Difference]: With dead ends: 391 [2019-03-04 16:31:06,072 INFO L226 Difference]: Without dead ends: 390 [2019-03-04 16:31:06,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18240 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14161, Invalid=23281, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:31:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-03-04 16:31:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-03-04 16:31:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-03-04 16:31:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-03-04 16:31:06,078 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-03-04 16:31:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:06,078 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-03-04 16:31:06,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-03-04 16:31:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-03-04 16:31:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-03-04 16:31:06,080 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:06,080 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-03-04 16:31:06,081 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-03-04 16:31:06,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:06,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:06,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:06,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:06,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:11,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:11,110 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:31:11,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:31:11,657 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-03-04 16:31:11,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:11,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 298 conjunts are in the unsatisfiable core [2019-03-04 16:31:11,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:11,673 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:11,673 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:11,683 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:11,683 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:17,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:17,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 194 [2019-03-04 16:31:17,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-03-04 16:31:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-03-04 16:31:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14454, Invalid=23766, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:31:17,012 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-03-04 16:31:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:17,918 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-03-04 16:31:17,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 16:31:17,918 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-03-04 16:31:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:17,920 INFO L225 Difference]: With dead ends: 395 [2019-03-04 16:31:17,920 INFO L226 Difference]: Without dead ends: 394 [2019-03-04 16:31:17,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18624 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14454, Invalid=23766, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:31:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-03-04 16:31:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-03-04 16:31:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-03-04 16:31:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-03-04 16:31:17,927 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-03-04 16:31:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:17,928 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-03-04 16:31:17,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-03-04 16:31:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-03-04 16:31:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-03-04 16:31:17,929 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:17,929 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-03-04 16:31:17,929 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:17,930 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-03-04 16:31:17,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:17,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:17,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:23,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:23,083 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:31:23,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:23,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 301 conjunts are in the unsatisfiable core [2019-03-04 16:31:23,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:23,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:31:23,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:23,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:31:23,214 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:28,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:28,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 196 [2019-03-04 16:31:28,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-03-04 16:31:28,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-03-04 16:31:28,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14750, Invalid=24256, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:31:28,686 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-03-04 16:31:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:29,488 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-03-04 16:31:29,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-03-04 16:31:29,488 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-03-04 16:31:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:29,490 INFO L225 Difference]: With dead ends: 399 [2019-03-04 16:31:29,490 INFO L226 Difference]: Without dead ends: 398 [2019-03-04 16:31:29,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19012 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14750, Invalid=24256, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:31:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-03-04 16:31:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-03-04 16:31:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-03-04 16:31:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-03-04 16:31:29,496 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-03-04 16:31:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:29,496 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-03-04 16:31:29,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-03-04 16:31:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-03-04 16:31:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-03-04 16:31:29,498 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:29,498 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-03-04 16:31:29,498 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-03-04 16:31:29,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:29,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:34,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:34,724 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:31:34,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:31:34,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:31:34,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:34,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 304 conjunts are in the unsatisfiable core [2019-03-04 16:31:34,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:34,846 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:34,846 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:34,856 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:34,856 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:40,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 198 [2019-03-04 16:31:40,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-03-04 16:31:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-03-04 16:31:40,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15049, Invalid=24751, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:31:40,425 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-03-04 16:31:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:41,277 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-03-04 16:31:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-03-04 16:31:41,278 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-03-04 16:31:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:41,279 INFO L225 Difference]: With dead ends: 403 [2019-03-04 16:31:41,280 INFO L226 Difference]: Without dead ends: 402 [2019-03-04 16:31:41,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19404 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15049, Invalid=24751, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:31:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-03-04 16:31:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-03-04 16:31:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-03-04 16:31:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-03-04 16:31:41,287 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-03-04 16:31:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:41,288 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-03-04 16:31:41,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-03-04 16:31:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-03-04 16:31:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-03-04 16:31:41,289 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:41,289 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-03-04 16:31:41,289 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-03-04 16:31:41,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:41,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:46,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:46,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 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:31:46,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:31:47,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-03-04 16:31:47,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:47,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 307 conjunts are in the unsatisfiable core [2019-03-04 16:31:47,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:47,486 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:47,486 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,494 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:47,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:31:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:53,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:53,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 200 [2019-03-04 16:31:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-03-04 16:31:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-03-04 16:31:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:31:53,186 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-03-04 16:31:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:54,135 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-03-04 16:31:54,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:31:54,135 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-03-04 16:31:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:54,137 INFO L225 Difference]: With dead ends: 407 [2019-03-04 16:31:54,137 INFO L226 Difference]: Without dead ends: 406 [2019-03-04 16:31:54,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19800 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:31:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-03-04 16:31:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-03-04 16:31:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-03-04 16:31:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-03-04 16:31:54,144 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-03-04 16:31:54,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:54,144 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-03-04 16:31:54,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-03-04 16:31:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-03-04 16:31:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-03-04 16:31:54,147 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:54,147 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-03-04 16:31:54,147 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-03-04 16:31:54,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:54,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:54,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:54,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:59,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:59,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:31:59,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:31:59,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:31:59,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:59,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:31:59,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:59,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:59,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 104 [2019-03-04 16:31:59,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-03-04 16:31:59,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-03-04 16:31:59,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-03-04 16:31:59,774 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-03-04 16:32:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:00,995 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-03-04 16:32:00,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-03-04 16:32:00,996 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-03-04 16:32:00,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:00,997 INFO L225 Difference]: With dead ends: 408 [2019-03-04 16:32:00,997 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:32:01,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:32:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:32:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:32:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:32:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:32:01,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-03-04 16:32:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:01,001 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:32:01,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-03-04 16:32:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:32:01,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:32:01,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:32:01,144 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-03-04 16:32:04,052 WARN L181 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-03-04 16:32:04,060 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-03-04 16:32:04,060 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-03-04 16:32:04,060 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-03-04 16:32:04,060 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-03-04 16:32:04,060 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-03-04 16:32:04,061 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-03-04 16:32:04,063 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (= main_q.offset main_p.offset) (<= main_q.offset 0) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-03-04 16:32:04,063 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-03-04 16:32:04,127 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:32:04 BoogieIcfgContainer [2019-03-04 16:32:04,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:32:04,132 INFO L168 Benchmark]: Toolchain (without parser) took 489999.22 ms. Allocated memory was 135.3 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 110.5 MB in the beginning and 583.1 MB in the end (delta: -472.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-03-04 16:32:04,133 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:32:04,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.75 ms. Allocated memory is still 135.3 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:32:04,134 INFO L168 Benchmark]: Boogie Preprocessor took 25.05 ms. Allocated memory is still 135.3 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:32:04,134 INFO L168 Benchmark]: RCFGBuilder took 326.16 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 96.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:32:04,135 INFO L168 Benchmark]: TraceAbstraction took 489589.66 ms. Allocated memory was 135.3 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 96.3 MB in the beginning and 583.1 MB in the end (delta: -486.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-03-04 16:32:04,136 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.75 ms. Allocated memory is still 135.3 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.05 ms. Allocated memory is still 135.3 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 326.16 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 96.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 489589.66 ms. Allocated memory was 135.3 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 96.3 MB in the beginning and 583.1 MB in the end (delta: -486.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset == p!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 489.3s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 41.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7406 SDslu, 7713 SDs, 0 SdLazy, 28212 SolverSat, 342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25654 GetRequests, 15451 SyntacticMatches, 0 SemanticMatches, 10203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666897 ImplicationChecksByTransitivity, 393.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 16.5s SatisfiabilityAnalysisTime, 415.8s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 2718 NumberOfCheckSat, 41003 ConstructedInterpolants, 0 QuantifiedInterpolants, 87584719 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 201 InterpolantComputations, 1 PerfectInterpolantSequences, 39603/1363500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...